A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new primal-dual path-following method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4920695 / 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: Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact spectral bundle method for convex quadratic semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential reduction algorithm for an extended SDP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps / 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: Symmetric primal-dual path-following algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact primal-dual path following algorithm for convex quadratic SDP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual interior-point algorithm for convex quadratic semi-definite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for convex quadratic semi-definite optimization / rank
 
Normal rank

Latest revision as of 23:33, 15 July 2024

scientific article
Language Label Description Also known as
English
A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
scientific article

    Statements

    A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (English)
    0 references
    0 references
    0 references
    21 June 2018
    0 references
    convex quadratic semidefinite optimization
    0 references
    interior point methods
    0 references
    short-step primal-dual algorithms
    0 references
    polynomial complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references