
KNITRO
 Referenced in 196 articles
[sw00490]
 effective for solving linear, quadratic, and nonlinear smooth optimization problems, both convex and nonconvex ... also effective for nonlinear regression, problems with complementarity constraints (MPCCs or MPECs), and mixedinteger...

MILES
 Referenced in 7 articles
[sw21982]
 Fortranbased solver for nonlinear complementarity problems and nonlinear systems of equations. The solution procedure ... this implementation, subproblems are solved as linear complementarity problems (LCPs), using an extension of Lemke ... lower bounds are represented implicitly. The linear solver employs the basis factorization package LUSOL, developed...

SCCP
 Referenced in 79 articles
[sw03318]
 complementarity problem (SCCP) is a broad class of optimization problems which contains many optimization problems ... algorithm solves at most one system of linear equations at each iteration. By using...

Dart
 Referenced in 4 articles
[sw38069]
 implicit timestepping, velocitybased LCP (linear complementarity problem) to guarantee nonpenetration, directional friction...

PathAVI
 Referenced in 1 article
[sw23744]
 important problem class that subsumes systems of linear equations, linear complementarity problems and optimality conditions ... infeasible) largescale sparse instances of the problem with theoretical guarantees and at high accuracy ... with good theoretical properties without reducing the problem to specialized forms, since such reductions ... linear programming techniques without employing a reduction. We also extend the class of problems that...

lemkelcp
 Referenced in 1 article
[sw40858]
 implementation of Lemke’s algorithm for linear complementarity problems. Namely, it attempts to find...

LemkeHowson
 Referenced in 1 article
[sw22505]
 variant of the Lemke algorithm for linear complementarity problems (LCPs). function nashEqbm = LemkeHowson(varargin...

LPCCbnc
 Referenced in 5 articles
[sw31750]
 linear constraints together with additional linear complementarity constraints. This class has emerged as a modeling ... paradigm for a broad collection of problems, including bilevel programs, Stackelberg games, inverse quadratic programs...

num4lcp
 Referenced in 0 articles
[sw27067]
 num4lcp: Numerical methods (NUM) for (4) linear complementarity problems (LCP) in physicsbased animation. This ... numerical methods for computing solutions for linear complementarity problems (LCPs). The intend with this library...

BBCPOP
 Referenced in 6 articles
[sw31757]
 minimization) problems (POPs) with binary, box and complementarity (BBC) constraints. Given ... order, BBCPOP constructs a simple conic optimization problem (COP), which serves as a DNN relaxation ... method. The COP is expressed with a linear objective function and constraints described...

iOptimize
 Referenced in 4 articles
[sw20377]
 modified potential function for the monotone complementarity problem. We show that this potential function ... iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving...

bilevel
 Referenced in 5 articles
[sw25305]
 Efficiently solving linear bilevel programming problems using offtheshelf optimization software. Many optimization models ... engineering are formulated as bilevel problems. Bilevel optimization problems are mathematical programs where a subset ... problems, most existing solution methods reformulate the bilevel problem as a mathematical program with complementarity...

FPC
 Referenced in 2 articles
[sw20468]
 convergence can be achieved under mild conditions. Problems in the form of (1) are often ... leastsquares term. In this case, qlinear convergence rates can be shown as long ... Hessian is full rank, or a strict complementarity condition holds. In order to obtain good...

DEGEN
 Referenced in 1 article
[sw07626]
 special emphasis on mathematical programs with complementarity constraints (MPCC). In the general case, we show ... convergence to stationary points of the problem under an error bound condition for the feasible ... such as the recently proposed relaxed positive linear dependence condition, should not be expected...

Kernel Cut
 Referenced in 1 article
[sw38990]
 based segmentation. While addressing closely related practical problems, these general methodologies may seem very different ... kernel clustering criteria like normalized cut. Complementarity of such terms is demonstrated in many applications ... movemaking, our main focus are new linear kernel and spectral bounds for kernel clustering...

PATHNLP
 Referenced in 0 articles
[sw21984]
 document describes the GAMS/PATHNLP solver for nonlinear programs and the options unique to this ... system using the PATH solver for complementarity problems. The solution to the original...

ADOLC
 Referenced in 249 articles
[sw00019]
 ADOLC: Automatic Differentiation of C/C++. We present...

ANSYS
 Referenced in 703 articles
[sw00044]
 ANSYS offers a comprehensive software suite that spans...

BARON
 Referenced in 354 articles
[sw00066]
 BARON is a computational system for solving nonconvex...

BPMPD
 Referenced in 41 articles
[sw00088]
 BPMPD is a stateoftheart implementation...