A comparison of large scale mixed complementarity problem solvers
From MaRDI portal
Publication:1363058
DOI10.1023/A:1008632215341zbMATH Open0883.90116OpenAlexW1881816275MaRDI QIDQ1363058FDOQ1363058
Authors: Stephen C. Billups, Steven P. Dirkse, Michael C. Ferris 
Publication date: 23 March 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008632215341
Recommendations
- scientific article; zbMATH DE number 1552024
- The semismooth algorithm for large scale complementarity problems
- QPCOMP: A quadratic programming based solver for mixed complementarity problems
- Feasible descent algorithms for mixed complementarity problems
- Extension of GAMS for complementarity problems arising in applied economic analysis
Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)
Cited In (38)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- Properties of a family of merit functions and a merit function method for the NCP
- Numerical comparisons of two effective methods for mixed complementarity problems
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Geometric views of the generalized fischer-burmeister function and its induced merit function
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
- The Hertz contact problem, coupled Volterra integral equations and a linear complementarity problem
- A new class of penalized NCP-functions and its properties
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
- Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- Generation flexibility in ramp rates: strategic behavior and lessons for electricity market design
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- The interpolating element-free Galerkin method for the \(p\)-Laplace double obstacle mixed complementarity problem
- Best practices for comparing optimization algorithms
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A non-interior continuation algorithm for the CP based on a generalized smoothing function
- Numerical simulation of piecewise-linear models of gene regulatory networks using complementarity systems
- New smooth gap function for box constrained variational inequalities
- Homotopy method for solving ball-constrained variational inequalities
- Some results on the filter method for nonlinear complementary problems
- An unconstrained differentiable penalty method for implicit complementarity problems
- A box-constrained differentiable penalty method for nonlinear complementarity problems
- A server for automated performance analysis of benchmarking data
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function
- Complementarity problems in GAMS and the PATH solver
- Title not available (Why is that?)
- An interior point algorithm for mixed complementarity nonlinear problems
- Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
- The locally Chen-Harker-Kanzow-Smale smoothing functions for mixed complementarity problems
- The linear convergence of a derivative-free descent method for nonlinear complementarity problems
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Modified Newton-type methods for the NCP by using a class of one-parametric NCP-functions
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
Uses Software
This page was built for publication: A comparison of large scale mixed complementarity problem solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363058)
