An update rule and a convergence result for a penalty function method

DOI10.3934/JIMO.2007.3.381zbMath1288.49010OpenAlexW2313050078MaRDI QIDQ2469809

C. Yalçın Kaya, Regina Sandra Burachik

Publication date: 11 February 2008

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2007.3.381

zbMATH Keywords

nonsmooth optimizationdualitynonconvex optimizationpenalty function methodleast exact penalty parameterpenalty parameter update

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Numerical methods based on nonlinear programming (49M37)

Related Items (12)

A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality ⋮ Optimization over the efficient set of multi-objective convex optimal control problems ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ 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 ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ A primal dual modified subgradient algorithm with sharp Lagrangian ⋮ On primal convergence for augmented Lagrangian duality ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems

This page was built for publication: An update rule and a convergence result for a penalty function method