Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming

DOI10.1023/A:1020261001771MaRDI QIDQ1812073zbMATH OpenOpenAlexFDO

Authors Rafail N. Gasimov

Publication date 18 June 2003

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020261001771

zbMATH Keywords

Nonconvex programmingAugmented LagrangianSubgradient methodCutting plane methodDuality with zero gap

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• An augmented Lagrangian method for non-Lipschitz nonconvex programming
• Augmented Lagrangian and nonlinear semidefinite programs
• Nonlinear augmented Lagrangian for nonconvex multiobjective optimization
• Duality in nonlinear programs using augmented Lagrangian functions
• Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces
• A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
• On the complexity of an augmented Lagrangian method for nonconvex optimization
• Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
• Augmented Lagrangian methods for nonlinear programming with possible infeasibility
• scientific article; zbMATH DE number 874651

Cited in

(72)

• An inexact modified subgradient algorithm for nonconvex optimization
• Generalized derivatives and optimality conditions in nonconvex optimization
• Weak subdifferential/superdifferential, weak exhausters and optimality conditions
• A conic scalarization method in multi-objective optimization
• Optimality conditions via weak subdifferentials in reflexive Banach spaces
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• A sharp augmented Lagrangian-based method in constrained non-convex optimization
• Conic scalarization method in multiobjective optimization and relations with other scalarization methods
• A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
• Stochastic subgradient algorithm for nonsmooth nonconvex optimization
• A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
• Generalized weak subdifferentials
• A Derivation of Lovász' Theta via Augmented Lagrange Duality
• Existence and characterization theorems in nonconvex vector optimization
• A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize
• A primal-dual augmented Lagrangian
• Augmented Lagrangian methods for nonlinear programming with possible infeasibility
• scientific article; zbMATH DE number 2221956 (Why is no real title available?)
• Radial epiderivatives and set-valued optimization
• Some notes on weak subdifferential
• A primal dual modified subgradient algorithm with sharp Lagrangian
• Saddle point and exact penalty representation for generalized proximal Lagrangians
• Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
• Duality in nonconvex vector optimization
• Perfect duality theory and complete solutions to a class of global optimization problems*
• Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems
• On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
• Dual bounds in convex and nonconvex nondifferentiable optimization problems and applications
• Material requirement planning with fuzzy constraints and fuzzy coefficients
• Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
• Weak-stability and saddle point theorems for a multiobjective optimization problem with an infinite number of constraints
• Canonical duality theory: connections between nonconvex mechanics and global optimization
• Separation theorems for nonconvex sets and application in optimization
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
• scientific article; zbMATH DE number 3920207 (Why is no real title available?)
• Generalized quadratic multiple knapsack problem and two solution approaches
• The modified subgradient algorithm based on feasible values
• Canonical duality for box constrained nonconvex and nonsmooth optimization problems
• An augmented penalty function method with penalty parameter updates for nonconvex optimization
• Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
• On generalized weak subdifferentials and some properties
• Stability and duality of nonconvex problems via augmented Lagrangian
• An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
• Optimality conditions in nonconvex optimization via weak subdifferentials
• Feasible modified subgradient method for solving the thermal unit commitment problem as a new approach
• Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
• Revisiting augmented Lagrangian duals
• A nonlinear programming approach for the sliding mode control design
• Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal
• Decomposition methods for global solution of mixed-integer linear programs
• Augmented Lagrangian duality for composite optimization problems
• On weak subdifferential and augmented normal cone
• The analytic hierarchy process and multiobjective 0--1 faculty course assignment
• Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
• Combined forecasts in portfolio optimization: a generalized approach
• Nonlinear Augmented Lagrangian and Duality Theory
• Weak subgradient method for solving nonsmooth nonconvex optimization problems
• The exact penalty map for nonsmooth and nonconvex optimization
• A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality
• New convergence properties of the primal augmented Lagrangian method
• An overview of advances in combinatorial optimization related topics
• A non-local topology-preserving segmentation-guided registration model
• A hybrid global optimization algorithm for nonlinear least squares regression
• A nonlinear augmented Lagrangian for constrained minimax problems
• Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
• On primal convergence for augmented Lagrangian duality
• A subgradient method based on gradient sampling for solving convex optimization problems
• Recent advances in dynamic facility layout research
• Some relationships among gw-subdifferential, directional derivative and radial epiderivative for nonconvex vector functions
• Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation
• Inexact subgradient methods for quasi-convex optimization problems
• A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm

This page was built for publication: Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812073)