A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q1928163): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-012-0194-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115035264 / 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: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / 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: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix / 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: A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps / 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: An inexact primal-dual path following algorithm for convex quadratic SDP / 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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / 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: Q4339096 / 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: 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

Latest revision as of 01:55, 6 July 2024

scientific article
Language Label Description Also known as
English
A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
scientific article

    Statements

    A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (English)
    0 references
    0 references
    2 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    convex quadratic semi-definite optimization
    0 references
    kernel function
    0 references
    interior-point algorithm
    0 references
    large-update method
    0 references
    complexity
    0 references
    0 references
    0 references