Two interior-point methods for nonlinear P_*()-complementarity problems.

DOI10.1023/A:1022606324827zbMATH Open1054.90635OpenAlexW1553507387MaRDI QIDQ1807690FDOQ1807690

Authors: Yanyan Li 

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

Recommendations

• Interior-point methods for nonlinear complementarity problems
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
• Interior point algorithm for \(P_*\) nonlinear complementarity problems
• A wide-neighborhood infeasible-interior-point algorithms for uniform P-function nonlinear complementary problems and its computational complexity

zbMATH Keywords

polynomial complexityinterior-point algorithmnonlinear \(P_*\)-complementarityscaled Lipschitz condition

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• \(P_ *\)-matrices are just sufficient
• Title not available (Why is that?)
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A path following algorithm for a class of convex programming problems
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A polynomial-time algorithm for a class of linear complementarity problems
• Exceptional family of elements for a variational inequality problem and its applications
• Complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
• Interior-point methods for nonlinear complementarity problems
• An Infeasible Path-Following Method for Monotone Complementarity Problems
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• A class of linear complementarity problems solvable in polynomial time
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• A new continuation method for complementarity problems with uniform P- functions
• An interior point potential reduction algorithm for the linear complementarity problem
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
• Determining the handicap of a sufficient matrix
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*
• Global linear convergence of a path-following algorithm for some monotone variational inequality problems
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
• A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
• Title not available (Why is that?)
• Modified primal path-following scheme for the monotone variational inequality problem

Cited In (17)

• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
• Title not available (Why is that?)
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
• Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
• Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
• The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems
• Interior point methods for solving Pareto eigenvalue complementarity problems
• A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
• Interior-point algorithms for uniform \(P\)-function nonlinear complementary problem based on algebraically equivalent path
• Title not available (Why is that?)
• On two interior-point mappings for nonlinear semidefinite complementarity problems
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*
• An interior point algorithm for mixed complementarity nonlinear problems
• Long-step homogeneous interior-point algorithm for the \(P_*\)-nonlinear complementarity problems

This page was built for publication: Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807690)