An augmented penalty function method with penalty parameter updates for nonconvex optimization
type: Item
instance of: scholarly article
title: An augmented penalty function method with penalty parameter updates for nonconvex optimization
zbMATH Open document ID: 1229.90135
author: C. Y. Kaya
author: R. S. Burachik
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2011-12-21T00:00:00Z
full work available at URL: https://ap01.alma.exlibrisgroup.com/view/delivery/61USOUTHAUS_INST/12142890360001831
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M29
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 5991129
zbMATH Keywords: duality scheme
zbMATH Keywords: penalty method
zbMATH Keywords: augmented Lagrangian
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: kissing number problem
describes a project that uses: SolvOpt
describes a project that uses: AMPL
describes a project that uses: Ipopt
MaRDI profile type: Publication
OpenAlex ID: W2027659296
Wikidata QID: Q58048434
cites work: Variational Analysis
cites work: On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
cites work: Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
cites work: An update rule and a convergence result for a penalty function method
cites work: An inexact modified subgradient algorithm for nonconvex optimization
cites work: A primal dual modified subgradient algorithm with sharp Lagrangian
cites work: Duality and exact penalization for general augmented Lagrangians
cites work: A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
cites work: On primal convergence for augmented Lagrangian duality
cites work: Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming
cites work: An implementation of Shor's \(r\)-algorithm
cites work: Q5638112
cites work: The Theory of Max-Min, with Applications
cites work: Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
DOI: 10.1016/J.NA.2011.03.013
description: scientific article; zbMATH DE number 5991129