Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / 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.1007/s12532-012-0046-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114416272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing a primal-dual interior-point method for conic quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolving in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A warm-start approach for large-scale stochastic linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interior-Point Warmstarts for Linear and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Portfolio Selection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization With the Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic convex programming and self-dual embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Primal- and Dual-Optimal Bases / 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / 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: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified homogeneous and self-dual linear programming algorithm and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm-Start Strategies in Interior-Point Methods for Linear Programming / rank
 
Normal rank

Latest revision as of 08:18, 6 July 2024

scientific article
Language Label Description Also known as
English
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
scientific article

    Statements

    Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (English)
    0 references
    0 references
    0 references
    0 references
    12 April 2013
    0 references
    warmstart
    0 references
    interior point method
    0 references
    homogeneous model
    0 references
    conic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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