An infeasible full-NT step interior point algorithm for CQSCO
From MaRDI portal
Publication:503355
DOI10.1007/s11075-016-0140-9zbMath1360.90290OpenAlexW2407544881MaRDI QIDQ503355
Publication date: 12 January 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0140-9
interior-point methodpolynomial complexityEuclidean Jordan algebraconvex quadratic symmetric cone optimizationinfeasible method
Related Items
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 Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood
Uses Software
Cites Work
- Unnamed Item
- 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 full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- Feasibility issues in a primal-dual interior-point method for linear programming
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A primal-dual infeasible-interior-point algorithm for linear programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone 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
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
