The progressive decoupling algorithm solves problems of optimization by iteratively suppressing complications coming from linear linkage relations. Here its formulation is significantly extended and a sharper theory of convergence is provided. Minimization steps no longer have to be executed exactly, and proximal terms in broadened form, potentially for numerical preconditioning, can vary from one iteration to the next. Linear convergence, for which no results were previously available, is tied precisely to a condition of metric subregularity at the solution, with its rate given by a formula based on the modulus of that property. It is established that, for problems with piecewise linear-quadratic objectives, linear convergence is guaranteed, and that for convex general objectives the lack of it is, in a perturbational sense, rare. The methodology is shown to be extendable also to problem decomposition with nonconvex objectives, but with shortcomings so far in practical implementability.
Advances in progressive decoupling methodology for problem decomposition in optimization. // Applied Nanoscience. – 2026. – DOI: 10.1007/s10107-026-02430-5. – URL: https://link.springer.com/article/10.1007/s10107-026-02430-5
(2026). Advances in progressive decoupling methodology for problem decomposition in optimization. Applied Nanoscience. https://doi.org/10.1007/s10107-026-02430-5
“Advances in progressive decoupling methodology for problem decomposition in optimization.” Applied Nanoscience, 2026. doi:10.1007/s10107-026-02430-5.
@article{article34411,
title = {Advances in progressive decoupling methodology for problem decomposition in optimization},
journal = {Applied Nanoscience},
year = {2026},
doi = {10.1007/s10107-026-02430-5},
url = {https://link.springer.com/article/10.1007/s10107-026-02430-5}
}
An algorithm based on the interior-point methodology for solving continuous nonlinearly constrained optimization problems is proposed, analyzed, and tested. The distinguishing feature of the algorithm is that it presumes that only noisy...
Introduced by Beck and Teboulle in [1], FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov’s accelerated gradient method for convex functions [2],...
This paper introduces a class of two-stage stochastic minimax problems where the first-stage objective function is nonconvex-concave while the second-stage objective function is strongly convex-concave. We establish properties of the...
Inspired by Von Neumann’s foundational work on expected utility, this paper extends the data-driven expected utility maximization framework under constant absolute risk aversion (CARA) preferences by incorporating nonlinear payoff...
This paper develops a unified lattice-theoretic framework for envelope constructions of sets and extended real-valued functions. Given a subset $$\mathcal {F}$$ of a complete lattice $${\mathcal {E}}$$, we associate with $$\mathcal...