Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q327227
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yu. E. Nesterov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2012.737327 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019266326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Infinity-Norm Path Following Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path / 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: Long-step strategies in interior-point primal-dual methods / 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: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Riemannian geometry defined by self-concordant barriers and interior-point methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / 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

Latest revision as of 14:15, 6 July 2024

scientific article; zbMATH DE number 6179993
Language Label Description Also known as
English
Hessian distances and their applications in the complexity analysis of interior-point methods
scientific article; zbMATH DE number 6179993

    Statements

    Hessian distances and their applications in the complexity analysis of interior-point methods (English)
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    0 references
    conic optimization problems
    0 references
    interior-point methods
    0 references
    polynomial-time methods
    0 references
    infeasible-start schemes
    0 references
    0 references