The following pages link to OPECgen (Q25377):
Displaying 19 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
- A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities (Q657283) (← links)
- Lifting mathematical programs with complementarity constraints (Q662308) (← links)
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints (Q842762) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations (Q1941032) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- Imputing a variational inequality function or a convex objective function: a robust approach (Q2408655) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
- Newton-type method for a class of mathematical programs with complementarity constraints (Q2477225) (← links)
- Hybrid approach with active set identification for mathematical programs with complementarity constraints (Q2499368) (← links)
- A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- A Constructive Approach to Estimating Pure Characteristics Demand Models with Pricing (Q3450466) (← links)
