A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1051/ro/2010016 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118187018 / rank
 
Normal rank
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: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of monotone linear complementarity problems over cones to linear programs over cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / 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: 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: 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: Self-regular functions and new search directions for linear and semidefinite optimization / 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: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/RO/2010016 / rank
 
Normal rank

Latest revision as of 09:33, 20 December 2024

scientific article
Language Label Description Also known as
English
A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
scientific article

    Statements

    A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (English)
    0 references
    24 November 2010
    0 references
    convex quadratic semidefinite optimization
    0 references
    interior-point algorithm
    0 references
    small-update method
    0 references
    iteration bound
    0 references
    polynomial-time
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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