A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4347846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for linear programming based on the logarithmic barrier method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual affine-scaling potential-reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity analysis of the primal-dual Newton method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric primal-dual path-following algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nesterov--Todd Direction in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00275-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969136247 / rank
 
Normal rank

Latest revision as of 11:33, 30 July 2024

scientific article
Language Label Description Also known as
English
A new class of polynomial primal-dual methods for linear and semidefinite optimization
scientific article

    Statements

    A new class of polynomial primal-dual methods for linear and semidefinite optimization (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2002
    0 references
    Linear optimization
    0 references
    Semidefinite optimization
    0 references
    Interior point method
    0 references
    Primal-dual Newton method
    0 references
    Polynomialcomplexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers