• KNITRO

  • Referenced in 180 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 mixed-integer...
  • MILES

  • Referenced in 6 articles [sw21982]
  • Fortran-based 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 77 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 2 articles [sw38069]
  • implicit time-stepping, velocity-based LCP (linear complementarity problem) to guarantee non-penetration, directional friction...
  • PathAVI

  • Referenced in 1 article [sw23744]
  • important problem class that subsumes systems of linear equations, linear complementarity problems and optimality conditions ... infeasible) large-scale 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...
  • LemkeHowson

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

  • Referenced in 4 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 physics-based animation. This ... numerical methods for computing solutions for linear complementarity problems (LCPs). The intend with this library...
  • 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...
  • BBCPOP

  • Referenced in 3 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...
  • FPC

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

  • Referenced in 3 articles [sw25305]
  • Efficiently solving linear bilevel programming problems using off-the-shelf 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...
  • 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...
  • PATHNLP

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

  • Referenced in 244 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • BARON

  • Referenced in 324 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • BPMPD

  • Referenced in 40 articles [sw00088]
  • BPMPD is a state-of-the-art implementation...
  • CSDP

  • Referenced in 200 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • C-XSC 2.0

  • Referenced in 125 articles [sw00182]
  • A C++ class library for extended scientific computing...