``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy splitting for antiblocking corners and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of geometric programming test problems and their solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Programming: Methods, Computations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-concordant barrier functions for conic hulls and fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Self-Concordance of the Universal Barrier Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic Polynomials and Interior Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and sorting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm for solving primal and dual geometric programs / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point 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 Quadratically Convergent Polynomial Algorithm for Solving Entropy 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: Generalization of primal-dual interior-point methods to convex optimization problems in conic form / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of <i>p</i>-Norms / rank
 
Normal rank

Latest revision as of 09:11, 10 June 2024

scientific article
Language Label Description Also known as
English
``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods
scientific article

    Statements

    ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (English)
    0 references
    0 references
    0 references
    19 April 2005
    0 references
    Convex optimization
    0 references
    Interior-point methods
    0 references
    Primal-dual algorithms
    0 references
    Self-concordant barriers
    0 references
    0 references
    0 references

    Identifiers