A Class of penalty functions for optimization problema with bound constraints

DOI10.1080/02331939208843855zbMath0817.90106OpenAlexW2078283558MaRDI QIDQ4327972

Francisco Facchinei, Stefano Lucidi

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843855

zbMATH Keywords

unconstrained minimizationcontinuously differentiable globally exact penalty functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (9)

Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems ⋮ An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems ⋮ Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities ⋮ Modified active set projected spectral gradient method for bound constrained optimization ⋮ An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables ⋮ Constraint incorporation in optimization ⋮ New constrained optimization reformulation of complementarity problems ⋮ Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation ⋮ A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set

This page was built for publication: A Class of penalty functions for optimization problema with bound constraints