Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
type: Item
instance of: scholarly article
title: Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
zbMATH Open document ID: 1327.90227
author: Wilhelm P. Freire
author: C. Y. Kaya
author: R. S. Burachik
published in: Journal of Global Optimization
publication date: 2014-12-11T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M29
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6379558
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: augmented Lagrangian duality
zbMATH Keywords: deflected subgradient method
zbMATH Keywords: nonsmooth feasible directions algorithm
zbMATH Keywords: kissing number problem
Wikidata QID: Q58048417
describes a project that uses: PBNCGC
describes a project that uses: PNEW
describes a project that uses: LDGB
describes a project that uses: QSM
describes a project that uses: NSO
describes a project that uses: MPBNGC
describes a project that uses: SolvOpt
MaRDI profile type: Publication
full work available at URL: s10898-013-0108-4
OpenAlex ID: W2006447341
cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization
cites work: A quasisecant method for minimizing nonsmooth functions
cites work: On primal convergence for augmented Lagrangian duality
cites work: On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
cites work: A primal dual modified subgradient algorithm with sharp Lagrangian
cites work: Duality and exact penalization for general augmented Lagrangians
cites work: An update rule and a convergence result for a penalty function method
cites work: An augmented penalty function method with penalty parameter updates for nonconvex optimization
cites work: A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
cites work: An inexact modified subgradient algorithm for nonconvex optimization
cites work: Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
cites work: New limited memory bundle method for large-scale nonsmooth optimization
cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization
cites work: Feasible direction interior-point technique for nonlinear optimization
cites work: A feasible directions method for nonsmooth convex optimization
cites work: Test examples for nonlinear programming codes
cites work: An implementation of Shor's \(r\)-algorithm
cites work: Comparing different nonsmooth minimization methods and software
cites work: Globally convergent cutting plane method for nonconvex nonsmooth minimization
cites work: Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
cites work: A bundle-Newton method for nonsmooth unconstrained minimization
cites work: Q4004158
cites work: Variational Analysis
cites work: Q5187067
DBLP publication ID: journals/jgo/BurachikFK14
DOI: 10.1007/S10898-013-0108-4
description: scientific article; zbMATH DE number 6379558