A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
From MaRDI portal
Publication:279828
DOI10.1007/s11590-015-0884-5zbMath1346.90814OpenAlexW2059388402MaRDI QIDQ279828
Publication date: 29 April 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0884-5
polynomial complexityinfeasible interior-point methodCartesian \(P_*(\kappa)\) linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (6)
An infeasible full NT-step interior point method for circular optimization ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ 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 ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementary problems
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
