A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 00:38, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming	scientific article

Statements

scholarly article

0 references

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

0 references

0 references

0 references

0 references

Journal of Optimization Theory and Applications

0 references

publication date

11 November 2013

0 references

zbMATH Keywords

Jordan algebra

0 references

symmetric cone programming

0 references

wide neighborhood

0 references

infeasible-interior-point method

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-013-0303-y

0 references

A new polynomial-time algorithm for linear programming

0 references

0 references

0 references

Linear programming: foundations and extensions

0 references

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

0 references

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

0 references

0 references

Barrier Functions in Interior Point Methods

0 references

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

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

0 references

Interior-point methods based on kernel functions for symmetric optimization

0 references

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

0 references

0 references

Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones

0 references

Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone 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

Superlinear convergence of interior-point algorithms for semidefinite programming

0 references

A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming

0 references

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

0 references

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 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

Function spaces and reproducing kernels on bounded symmetric domains

0 references

Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones

0 references

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

0 references

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

0 references

On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10957-013-0303-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:378283

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