On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
From MaRDI portal
Publication:2216183
DOI10.1007/S00186-020-00708-8zbMATH Open1497.90161OpenAlexW3012023827MaRDI QIDQ2216183FDOQ2216183
Recommendations
- Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
- Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization
- Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
- A Nonconvex Duality with Zero Gap and Applications
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
Cites Work
- scientific article; zbMATH DE number 994348 (Why is no real title available?)
- scientific article; zbMATH DE number 5617354 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 1017537 (Why is no real title available?)
- scientific article; zbMATH DE number 7297334 (Why is no real title available?)
- scientific article; zbMATH DE number 6409510 (Why is no real title available?)
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A Survey of the S-Lemma
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A nonlinear Lagrangian approach to constrained optimization problems
- A primal dual modified subgradient algorithm with sharp Lagrangian
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- A unifying theory of exactness of linear penalty functions
- Abstract Convexity and Augmented Lagrangians
- Abstract convexity and global optimization
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- An inexact modified subgradient algorithm for nonconvex optimization
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Characterizing FJ and KKT conditions in nonconvex mathematical programming with applications
- Convex Analysis
- Convexity of quadratic transformations and its use in control and optimization
- Decreasing Functions with Applications to Penalization
- Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- Further study on augmented Lagrangian duality theory
- Global saddle points of nonlinear augmented Lagrangian functions
- Lagrange Multipliers and Optimality
- Lagrange-type functions in constrained optimization
- Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Nonlinear Lagrangian theory for nonconvex optimization.
- Nonlinear Programming
- On $\Phi $-Convexity in Extremal Problems
- On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
- On augmented Lagrangians for optimization problems with a single constraint
- On generalized conjugations and subdifferentials in abstract convex analysis
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Optimization and nonsmooth analysis
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Radial epiderivatives and set-valued optimization
- Separation theorems for nonconvex sets and application in optimization
- Stability and duality of nonconvex problems via augmented Lagrangian
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- The modified subgradient algorithm based on feasible values
- Variational Analysis
- Zero duality gap and attainment with possibly non-convex data
- Zero duality gap for a class of nonconvex optimization problems
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
Cited In (11)
- Further study on augmented Lagrangian duality theory
- Zero duality gap conditions via abstract convexity
- Zero duality gap for a class of nonconvex optimization problems
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
- Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
- Strong duality in optimization: shifted power reformulation
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- The comparison on optimal objective values among the primal optimization problem and its three dual problems
- Generalized derivatives and optimality conditions in nonconvex optimization
This page was built for publication: On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216183)
