An infeasible full-NT step interior point algorithm for CQSCO
From MaRDI portal
Publication:503355
DOI10.1007/S11075-016-0140-9zbMATH Open1360.90290OpenAlexW2407544881MaRDI QIDQ503355FDOQ503355
Authors: Behrouz Kheirfam 
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
Recommendations
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
polynomial complexityEuclidean Jordan algebrainterior-point methodconvex quadratic symmetric cone optimizationinfeasible method
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
- An improved and simplified full-Newton step \(O(n)\) infeasible interior-point method for linear optimization
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A Jordan-algebraic approach to potential-reduction algorithms
- 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
- Similarity and other spectral relations for symmetric cones
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
Cited In (7)
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimisation
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- The Jordan algebraic structure of the rotated quadratic cone
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
Uses Software
This page was built for publication: An infeasible full-NT step interior point algorithm for CQSCO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503355)
