A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
From MaRDI portal
Publication:2249820
DOI10.1007/s10898-013-0090-xzbMath1300.90055MaRDI QIDQ2249820
Guo-Qiang Wang, Chang Jun Yu, Kok Lay Teo
Publication date: 3 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0090-x
linear complementarity problems; interior-point methods; polynomial complexity; \(P_\ast(\kappa)\)-matrix
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
Unnamed Item, Unnamed Item, A new full-NT step interior-point method for circular cone optimization, An extension for identifying search directions for interior-point methods in linear optimization, A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function, A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, Complexity analysis of a weighted-full-Newton step interior-point algorithm forP∗(κ)-LCP, A nonmonotone smoothing Newton method for circular cone programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- On homogeneous and self-dual algorithms for LCP
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- \(P_ *\)-matrices are just sufficient
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
