A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
From MaRDI portal
Recommendations
- A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
- A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
- scientific article; zbMATH DE number 1376878
Cited in
(23)- An interior point potential reduction method for constrained equations
- A pathsearch damped Newton method for computing general equilibria
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
- The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
- Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- A predictor-corrector method for extended linear-quadratic programming
- Fast algorithms for sparse portfolio selection considering industries and investment styles
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
- A projected-gradient interior-point algorithm for complementarity problems
- On the natural merit function for solving complementarity problems
- Inexact interior-point method
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Constant-rank condition and second-order constraint qualification
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems
- A sign-based linear method for horizontal linear complementarity problems
- An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
This page was built for publication: A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332253)
