A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
From MaRDI portal
Publication:398651
DOI10.1007/s10957-013-0457-7zbMath1293.90072OpenAlexW1982484829MaRDI QIDQ398651
Publication date: 15 August 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0457-7
horizontal linear complementarity problemcomplexity analysisinfeasible interior-point methodsfull-Newton step
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (13)
An infeasible full NT-step interior point method for circular optimization ⋮ A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A new full-NT step interior-point method for circular cone optimization ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem ⋮ An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step ⋮ An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- Corrector-predictor methods for sufficient linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
