Abstract Convexity and Augmented Lagrangians

DOI10.1137/050647621zbMath1190.90134OpenAlexW2089447917WikidataQ58048528 ScholiaQ58048528MaRDI QIDQ3503202

Regina Sandra Burachik, Alexander Rubinov

Publication date: 22 May 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/602cae8334e473f65d7d609f63127b5c65ae69f5

zbMATH Keywords

nonconvex programmingabstract convexityaugmented Lagrangiansstochastic semi-infinite programmingexact penalty representationLagrange-type functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Stochastic programming (90C15) Axiomatic and generalized convexity (52A01) Duality theory (optimization) (49N15)

Related Items (25)

Duality for composite optimization problem within the framework of abstract convexity ⋮ Regularly abstract convex functions with respect to the set of Lipschitz continuous concave functions ⋮ Generalized Lagrangian duality in set-valued vector optimization via abstract subdifferential ⋮ Existence of augmented Lagrange multipliers for semi-infinite programming problems ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality ⋮ Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ Zero duality gap conditions via abstract convexity ⋮ Duality and exact penalization for general augmented Lagrangians ⋮ Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle ⋮ Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression ⋮ A study of progressive hedging for stochastic integer programming ⋮ Abstract convex optimal antiderivatives ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ Unnamed Item ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ Augmented Lagrangian functions for constrained optimization problems ⋮ Exact augmented Lagrangian duality for mixed integer linear programming ⋮ Abstract convexity for nonconvex optimization duality ⋮ A primal dual modified subgradient algorithm with sharp Lagrangian ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ Existence of augmented Lagrange multipliers for cone constrained optimization problems ⋮ Semi-continuous quadratic optimization: existence conditions and duality scheme ⋮ On primal convergence for augmented Lagrangian duality ⋮ The exact penalty map for nonsmooth and nonconvex optimization

This page was built for publication: Abstract Convexity and Augmented Lagrangians