Regularized gap function as penalty term for constrained minimization problems

DOI10.1016/J.JMAA.2008.12.048MaRDI QIDQ1018314zbMATH OpenOpenAlexFDO

Authors 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 optimizationregularized gap functionmerit functionexact penalty functioninvexitybounded level setstrong coercivenessunconstrained reformulation

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
• Regularized gap functions for nonsmooth variational inequality problems
• Regularized gap functions for variational problems
• Gap functions and penalization for solving equilibrium problems with nonlinear constraints
• scientific article; zbMATH DE number 4020861
• Regularized gap functions and D-gap functions for nonsmooth variational inequalities.
• Error bounds of regularized gap functions for nonsmooth variational inequality problems
• New simple exact penalty function for constrained minimization
• Penalty function method and regularization in the analysis of improper convex programs
• Regularized gap functions and error bounds for vector variational inequalities

Cites work

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

Cited in

(2)

• Lagrangian regularization approach to constrained optimization problems
• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities

Describes a project that uses

Uses Software

• QSPLINE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018314)