Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming (Q4916315): Difference between revisions

Latest revision as of 09:53, 6 July 2024

scientific article; zbMATH DE number 6156382

Language	Label	Description	Also known as
English	Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming	scientific article; zbMATH DE number 6156382

Statements

instance of

scholarly article

0 references

title

Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming (English)

0 references

zbMATH Open document ID

1262.90192

0 references

DOI

10.1080/02331934.2011.571257

0 references

0 references

0 references

0 references

0 references

22 April 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

semidefinite optimization

0 references

full-Newton step

0 references

iteration bound

0 references

infeasible interior-point algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2011.571257

0 references

OpenAlex ID

W1993818022

0 references

cites work

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization

0 references

On the Convergence of the Central Path in Semidefinite Optimization

0 references

Primal--Dual Path-Following Algorithms for Semidefinite Programming

0 references

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

0 references

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

0 references

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

0 references

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

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4916315

@@ Property / author @@
+Li-Ming Sun
@@ Property / author: Li-Ming Sun / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331934.2011.571257
+Normal rank
@@ Property / OpenAlex ID @@
+W1993818022
@@ Property / OpenAlex ID: W1993818022 / rank @@
+Normal rank
@@ Property / cites work @@
+Aspects of semidefinite programming. Interior point algorithms and selected applications
+Normal rank
@@ Property / cites work @@
+Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
+Normal rank
@@ Property / cites work @@
+On the Convergence of the Central Path in Semidefinite  Optimization
+Normal rank
@@ Property / cites work @@
+Primal--Dual Path-Following Algorithms for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
+Normal rank