A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming: foundations and extensions / 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: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier Functions in Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of primal-dual interior point algorithms to symmetric cones / 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 / cites work
 
Property / cites work: Interior-point methods based on kernel functions for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear convergence of interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function spaces and reproducing kernels on bounded symmetric domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank

Latest revision as of 01:40, 7 July 2024

scientific article
Language Label Description Also known as
English
A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
scientific article

    Statements

    A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    0 references
    Jordan algebra
    0 references
    symmetric cone programming
    0 references
    wide neighborhood
    0 references
    infeasible-interior-point method
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references