Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality

DOI10.1007/s10898-013-0108-4zbMath1327.90227OpenAlexW2006447341WikidataQ58048417 ScholiaQ58048417MaRDI QIDQ480827

Wilhelm P. Freire, C. Yalçın Kaya, Regina Sandra Burachik

Publication date: 11 December 2014

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

Full work available at URL: https://doi.org/10.1007/s10898-013-0108-4

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationaugmented Lagrangian dualitydeflected subgradient methodkissing number problemnonsmooth feasible directions algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Numerical methods based on nonlinear programming (49M37)

Related Items (max. 100)

A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ On topology optimization and canonical duality method

Uses Software

• SolvOpt
• NSO
• PBNCGC
• PNEW
• QSM
• LDGB
• MPBNGC

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible directions method for nonsmooth convex optimization
• Globally convergent cutting plane method for nonconvex nonsmooth minimization
• Duality and exact penalization for general augmented Lagrangians
• An augmented penalty function method with penalty parameter updates for nonconvex optimization
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Test examples for nonlinear programming codes
• Feasible direction interior-point technique for nonlinear optimization
• A bundle-Newton method for nonsmooth unconstrained minimization
• An implementation of Shor's \(r\)-algorithm
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• An inexact modified subgradient algorithm for nonconvex optimization
• A primal dual modified subgradient algorithm with sharp Lagrangian
• An update rule and a convergence result for a penalty function method
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• Comparing different nonsmooth minimization methods and software
• A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
• On primal convergence for augmented Lagrangian duality
• A quasisecant method for minimizing nonsmooth functions
• Variational Analysis
• New limited memory bundle method for large-scale nonsmooth optimization

This page was built for publication: Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality