Abstract Convexity and Augmented Lagrangians

DOI10.1137/050647621zbMath1190.90134WikidataQ58048528 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 programming; abstract convexity; augmented Lagrangians; stochastic semi-infinite programming; exact penalty representation; Lagrange-type functions

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

65K10: Numerical optimization and variational techniques

90C15: Stochastic programming

52A01: Axiomatic and generalized convexity

49N15: Duality theory (optimization)

Related Items

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