An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
From MaRDI portal
Publication:721594
DOI10.1007/S12190-017-1128-XzbMath1392.90125OpenAlexW2750367319MaRDI QIDQ721594
Publication date: 19 July 2018
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-017-1128-x
polynomial complexityinfeasible interior-point methodsemidefinite linear complementarity problemNesterov-Todd scaling scheme
Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)
Related Items (5)
A new corrector-predictor interior-point method for symmetric cone optimization ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- A new primal-dual path-following method for convex quadratic programming
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Merit functions for semi-definite complementarity problems
- A primal-dual infeasible-interior-point algorithm for linear programming
- An exact duality theory for semidefinite programming and its complexity implications
- On semidefinite linear complementarity problems
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization
- A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
This page was built for publication: An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
