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

From MaRDI portal

Revision as of 22:48, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Full Nesterov-Todd step infeasible interior-point method for symmetric optimization	scientific article

Statements

scholarly article

0 references

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

0 references

Juan-Miguel Gracia

0 references

European Journal of Operational Research

0 references

publication date

19 August 2011

0 references

zbMATH Keywords

conic programming

0 references

Nesterov-Todd step

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2011.02.022

0 references

Lectures on Modern Convex Optimization

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

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

Barrier Functions in Interior Point Methods

0 references

A primal-dual infeasible-interior-point algorithm for linear programming

0 references

Feasibility issues in a primal-dual interior-point method for linear programming

0 references

Polynomiality of infeasible-interior-point algorithms for linear programming

0 references

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

An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

0 references

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

0 references

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

0 references

Interior Point Methods for Linear Optimization

0 references

Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

Similarity and other spectral relations for symmetric cones

0 references

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2011.02.022

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:635148

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q635148&oldid=38419608"