Pages that link to "Item:Q434165"

The following pages link to Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints (Q434165):

Displaying 18 items.

• Lifting mathematical programs with complementarity constraints (Q662308) (← links)
• Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints (Q742306) (← links)
• On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization (Q1694779) (← links)
• Active-set Newton methods for mathematical programs with vanishing constraints (Q1928752) (← links)
• The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization (Q1938516) (← links)
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
• The demand adjustment problem via inexact restoration method (Q2196267) (← links)
• A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems (Q2434995) (← links)
• Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption (Q2515067) (← links)
• Lifted stationary points of sparse optimization with complementarity constraints (Q2696930) (← links)
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints (Q2885492) (← links)
• Analysis of Highly Accurate Finite Element Based Algorithms for Computing Distances to Level Sets (Q2968166) (← links)
• Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints (Q3096884) (← links)
• Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method (Q4997170) (← links)
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments (Q5058394) (← links)
• A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods (Q5085138) (← links)
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited (Q5252220) (← links)
• Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming (Q5357005) (← links)