A two-parametric class of merit functions for the second-order cone complementarity problem

DOI10.1155/2013/571927zbMath1278.90401WikidataQ59003055 ScholiaQ59003055MaRDI QIDQ364429

Zijun Hao, Xiaoni Chi, Zhong-Ping Wan

Publication date: 9 September 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/571927

zbMATH Keywords

global error bound; unconstrained minimization problem

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

A power penalty method for second-order cone nonlinear complementarity problems

Uses Software

• SCCP
• LBFGS-B

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new one-step smoothing Newton method for second-order cone programming.
• Two classes of merit functions for the second-order cone complementarity problem
• A one-parametric class of merit functions for the second-order cone complementarity problem
• A one-parametric class of merit functions for the symmetric cone complementarity problem
• Applications of second-order cone programming
• Second-order cone programming
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• Interior point methods for second-order cone programming and OR applications
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Three classes of merit functions for the complementarity problem over a closed convex cone
• A new one-step smoothing newton method for the second-order cone complementarity problem
• SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• Numerical Optimization
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
• A Nonmonotone Line Search Technique for Newton’s Method
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Limited Memory Algorithm for Bound Constrained Optimization
• A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems