Box-constrained minimization reformulations of complementarity problems in second-order cones

DOI10.1007/S10898-006-9109-XMaRDI QIDQ2481360zbMATH OpenOpenAlexFDO

Authors A. Friedlander, S. A. Santos, R. Andreani, M. P. Mello

Publication date 9 April 2008

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-006-9109-x

zbMATH Keywords

minimization algorithms

Mathematics Subject Classification ID

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

Recommendations

• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• New constrained optimization reformulation of complementarity problems
• A boxed optimization reformulation for the convex second order cone programming
• A descent method for a reformulation of the second-order cone complementarity problem
• Stationary points of bound constrained minimization reformulations of complementarity problems

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 1076336 (Why is no real title available?)
• scientific article; zbMATH DE number 1569004 (Why is no real title available?)
• A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• A new trust region algorithm for bound constrained minimization
• A special newton-type optimization method
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Applications of second-order cone programming
• Engineering and Economic Applications of Complementarity Problems
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• On the resolution of monotone complementarity problems
• On the resolution of the generalized nonlinear complementarity problem
• Second-order cone programming
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems

Cited in

(11)

• Smoothing homotopy method for solving second-order cone complementarity problem
• Linear complementarity problems on extended second order cones
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• A semi-smooth Newton method for projection equations and linear complementarity problems with respect to the second order cone
• A boxed optimization reformulation for the convex second order cone programming
• A proximal gradient descent method for the extended second-order cone linear complementarity problem
• On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
• Equilibrium problems involving the Lorentz cone
• Solutions and optimality criteria to box constrained nonconvex minimization problems
• Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems
• Facial approach for constructing stationary points for mathematical programs with cone complementarity constraints

This page was built for publication: Box-constrained minimization reformulations of complementarity problems in second-order cones

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