A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807): Difference between revisions

Latest revision as of 03:11, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy	scientific article

Statements

instance of

scholarly article

0 references

title

A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (English)

0 references

0 references

0 references

Journal of Inequalities and Applications

0 references

publication date

24 November 2017

0 references

zbMATH Keywords

symmetric optimization

0 references

infeasible-interior-point method

0 references

arc-search

0 references

Mizuno-Todd-Ye predictor-corrector

0 references

iteration complexity

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1186/s13660-017-1565-y

0 references

cites work

A new polynomial-time algorithm for linear programming

0 references

Barrier Functions in Interior Point Methods

0 references

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

0 references

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

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

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

0 references

Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming

0 references

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

0 references

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

0 references

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

0 references

Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization

0 references

On the Implementation of a Primal-Dual Interior Point Method

0 references

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming

0 references

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

0 references

A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming

0 references

A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points

0 references

Modified predictor-corrector algorithm for locating weighted centers in linear programming

0 references

Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence

0 references

A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem

0 references

An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence

0 references

On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set

0 references

Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs

0 references

A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm

0 references

A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems

0 references

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

0 references

A Simple Variant of the Mizuno--Todd--Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity

0 references

A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones

0 references

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

0 references

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

0 references

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

0 references

A polynomial arc-search interior-point algorithm for convex quadratic programming

0 references

A polynomial arc-search interior-point algorithm for linear programming

0 references

An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path

0 references

A wide neighborhood infeasible-interior-point method with arc-search for linear programming

0 references

Q4321748

0 references

On a commutative class of search directions for linear programming over symmetric cones

0 references

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

0 references

Identifiers

zbMATH Open document ID

1375.90217

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1186/S13660-017-1565-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1681807

@@ Property / DOI @@
-.1186/s13660-017-1565-y
@@ Property / DOI: 10.1186/s13660-017-1565-y / rank @@
-Normal rank
@@ Property / DOI @@
+.1186/S13660-017-1565-Y
@@ Property / DOI: 10.1186/S13660-017-1565-Y / rank @@
+Normal rank