Three classes of merit functions for the complementarity problem over a closed convex cone

DOI10.1080/02331934.2011.611884zbMath1273.90148OpenAlexW1987843722MaRDI QIDQ2841144

Nan Lu, Zheng-Hai Huang

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

error boundcoercivenessstationary pointmerit functioncomplementarity problemclosed convex cone

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (4)

A two-parametric class of merit functions for the second-order cone complementarity problem ⋮ On merit functions for \(p\)-order cone complementarity problem ⋮ Constructions of complementarity functions and merit functions for circular cone complementarity problem ⋮ A nonmonotone smoothing Newton method for circular cone programming

Cites Work

• A merit function method for infinite-dimensional SOCCPs
• The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces
• GUS-property for Lorentz cone linear complementarity problems on Hilbert spaces
• Some P-properties for linear transformations on Euclidean Jordan algebras
• Two classes of merit functions for the second-order cone complementarity problem
• The non-existence of a regular exceptional family of elements. A necessary and sufficient condition. Applications to complementarity theory
• Smoothing algorithms for complementarity problems over symmetric cones
• A one-parametric class of merit functions for the symmetric cone complementarity problem
• Complementarity problems over cones with monotone and pseudomonotone maps
• An existence theorem for the complementarity problem
• Pseudo-monotone complementarity problems in Hilbert space
• Nonlinear complementarity as unconstrained and constrained minimization
• Euclidean Jordan algebras and interior-point algorithms
• Non-interior continuation methods for solving semidefinite complementarity problems
• Generalized complementarity problem
• An iterative method for generalized nonlinear complementarity problems
• On the coerciveness of some merit functions for complementarity problems over symmetric cones
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
• Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• An iterative method for generalized complementarity problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Complementarity problems

This page was built for publication: Three classes of merit functions for the complementarity problem over a closed convex cone