A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888)

scientific article; zbMATH DE number 7024422

Language	Label	Description	Also known as
English	A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization	scientific article; zbMATH DE number 7024422

Statements

instance of

scholarly article

0 references

title

A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (English)

0 references

zbMATH Open document ID

1407.90345

0 references

DOI

10.1080/10556788.2018.1528248

0 references

published in

Optimization Methods and Software

0 references

publication date

18 February 2019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

symmetric cone optimization

0 references

euclidean Jordan algebra

0 references

large neighbourhood of the central path

0 references

predictor-corrector interior-point algorithm

0 references

Nesterov-Todd directions

0 references

describes a project that uses

Netlib

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10556788.2018.1528248

0 references

OpenAlex ID

W2898622871

0 references

cites work

An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

0 references

A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

0 references

Benchmarking optimization software with performance profiles.

0 references

Q4321748

0 references

Euclidean Jordan algebras and interior-point algorithms

0 references

Linear systems in Jordan algebras and primal-dual interior-point algorithms

0 references

A Jordan-algebraic approach to potential-reduction algorithms

0 references

A new $O(\sqrt{n}L)$-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming

0 references

Full Nesterov-Todd step infeasible interior-point method for symmetric optimization

0 references

Barrier Functions in Interior Point Methods

0 references

Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems

0 references

A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

0 references

An $O(\sqrt nL)$ iteration primal-dual second-order corrector algorithm for linear programming

0 references

A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming

0 references

Conic convex programming and self-dual embedding

0 references

On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming

0 references

On the Implementation of a Primal-Dual Interior Point Method

0 references

A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

0 references

Q4324980

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

Primal-Dual Interior-Point Methods for Self-Scaled Cones

0 references

Q4791754

0 references

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity

0 references

Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

On the Nesterov--Todd Direction in Semidefinite Programming

0 references

A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization

0 references

A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization

0 references

A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4622888