Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
From MaRDI portal
Publication:1807690
DOI10.1023/A:1022606324827zbMath1054.90635OpenAlexW1553507387MaRDI QIDQ1807690
Publication date: 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022606324827
polynomial complexityinterior-point algorithmnonlinear \(P_*\)-complementarityscaled Lipschitz condition
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (7)
A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems ⋮ A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions ⋮ A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions ⋮ Unnamed Item ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones
Cites Work
- Unnamed Item
- Unnamed Item
- Determining the handicap of a sufficient matrix
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A new continuation method for complementarity problems with uniform P- functions
- A polynomial-time algorithm for a class of linear complementarity problems
- A class of linear complementarity problems solvable in polynomial time
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An interior point potential reduction algorithm for the linear complementarity problem
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- Exceptional family of elements for a variational inequality problem and its applications
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- Modified primal path-following scheme for the monotone variational inequality problem
- \(P_ *\)-matrices are just sufficient
- Interior-point methods for nonlinear complementarity problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- A path following algorithm for a class of convex programming problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- Complementarity problems
This page was built for publication: Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
