Regularized gap function as penalty term for constrained minimization problems

DOI10.1016/j.jmaa.2008.12.048zbMath1161.49030OpenAlexW2031250835MaRDI QIDQ1018314

Wu Li, Chandal Nahak

Publication date: 19 May 2009

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2008.12.048

zbMATH Keywords

constrained optimizationinvexitymerit functionstrong coercivenessregularized gap functionexact penalty functionbounded level setunconstrained reformulation

Mathematics Subject Classification ID

Uses Software

• QSPLINE

Cites Work

• The essence of invexity
• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
• On sufficiency of the Kuhn-Tucker conditions
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Gauss-Seidel method for least-distance problems
• Equivalence of variational inequality problems to unconstrained minimization
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
• A globally convergent Newton method for solving strongly monotone variational inequalities
• What is invexity?
• Variational principles for variational inequalities
• A New Algorithm for Solving Strictly Convex Quadratic Programs
• The Linear l₁ Estimator and the Huber M-Estimator
• Pseudo-Convex Functions

This page was built for publication: Regularized gap function as penalty term for constrained minimization problems