Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
DOI10.1007/s10107-016-1055-xzbMath1383.90025OpenAlexW2472896993WikidataQ59611508 ScholiaQ59611508MaRDI QIDQ526828
Ann-Brith Strömberg, Torbjörn Larsson, Magnus Önnheim, Michael Patriksson, Emil Gustavsson
Publication date: 15 May 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1055-x
subgradient algorithmergodic primal sequencehomogeneous Lagrangian functioninconsistent convex programLagrange dual
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- A bundle-filter method for nonsmooth convex constrained optimization
- A filter-variable-metric method for nonsmooth convex constrained optimization
- Two ``well-known properties of subgradient optimization
- Conditional subgradient optimization -- theory and applications
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- The smallest correction of an inconsistent system of linear inequalities
- Approximations in proximal bundle methods and decomposition of convex programs
- New variants of bundle methods
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Primal convergence from dual subgradient methods for convex optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Ergodic Convergence in Subgradient Optimization with Application to Simplicial Decomposition of Convex Programs
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- Steering exact penalty methods for nonlinear programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Ergodic convergence in subgradient optimization
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Nonlinear Programming
- Convex Analysis
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Minimization of unsmooth functionals
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
