Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
From MaRDI portal
Publication:1812073
DOI10.1023/A:1020261001771zbMath1047.90048OpenAlexW1531386198MaRDI QIDQ1812073
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
Cutting plane methodNonconvex programmingAugmented LagrangianSubgradient methodDuality with zero gap
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Recent advances in dynamic facility layout research ⋮ The analytic hierarchy process and multiobjective 0--1 faculty course assignment ⋮ Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation ⋮ Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ Inexact subgradient methods for quasi-convex optimization problems ⋮ A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality ⋮ Weak subdifferential/superdifferential, weak exhausters and optimality conditions ⋮ Unnamed Item ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ A conic scalarization method in multi-objective optimization ⋮ A hybrid global optimization algorithm for nonlinear least squares regression ⋮ Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal ⋮ Canonical duality for box constrained nonconvex and nonsmooth optimization problems ⋮ Material requirement planning with fuzzy constraints and fuzzy coefficients ⋮ Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem ⋮ Saddle point and exact penalty representation for generalized proximal Lagrangians ⋮ Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle ⋮ Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods ⋮ Generalized derivatives and optimality conditions in nonconvex optimization ⋮ Optimality conditions in nonconvex optimization via weak subdifferentials ⋮ A non-local topology-preserving segmentation-guided registration model ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ 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 ⋮ Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian ⋮ A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ An augmented penalty function method with penalty parameter updates for nonconvex optimization ⋮ New convergence properties of the primal augmented Lagrangian method ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Optimality conditions via weak subdifferentials in reflexive Banach spaces ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ Unnamed Item ⋮ Combined forecasts in portfolio optimization: a generalized approach ⋮ An overview of advances in combinatorial optimization related topics ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ A primal dual modified subgradient algorithm with sharp Lagrangian ⋮ On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian ⋮ Radial epiderivatives and set-valued optimization ⋮ The modified subgradient algorithm based on feasible values ⋮ A nonlinear programming approach for the sliding mode control design ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems ⋮ Duality in nonconvex vector optimization ⋮ Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems ⋮ Separation theorems for nonconvex sets and application in optimization ⋮ Generalized weak subdifferentials ⋮ Some relationships among gw-subdifferential, directional derivative and radial epiderivative for nonconvex vector functions ⋮ Perfect duality theory and complete solutions to a class of global optimization problems* ⋮ On primal convergence for augmented Lagrangian duality ⋮ The exact penalty map for nonsmooth and nonconvex optimization ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ Revisiting augmented Lagrangian duals ⋮ Some notes on weak subdifferential ⋮ Existence and characterization theorems in nonconvex vector optimization ⋮ On generalized weak subdifferentials and some properties
