swMATH13463MaRDI QIDQ25377FDOQ25377
Author name not available (Why is that?)
Official website: http://rd.springer.com/article/10.1023%2FA%3A1008696504163
Cited In (20)
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- On conic QPCCs, conic QCQPs and completely positive programs
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- Lifting mathematical programs with complementarity constraints
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- Imputing a variational inequality function or a convex objective function: a robust approach
- MacMPEC
- Computing B-stationary points of nonsmooth DC programs
- A constructive approach to estimating pure characteristics demand models with pricing
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A robust SQP method for mathematical programs with linear complementarity constraints
- On convex quadratic programs with linear complementarity constraints
- Newton-type method for a class of mathematical programs with complementarity constraints
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
This page was built for software: OPECgen
