Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / 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/s10589-018-0012-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2807481378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initialization in semidefinite programming via a self-dual skew-symmetric embedding / 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: Q4321748 / 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: A Jordan-algebraic approach to potential-reduction algorithms / 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: Barrier Functions in Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorem for dual linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial path-following interior point algorithm for general linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new infeasible interior-point method based on Darvay's technique for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization / 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: Feasibility issues in a primal-dual interior-point method for linear programming / 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: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite 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: An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of polynomial primal-dual methods for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Regular Interior-Point Methods for Semidefinite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of self-regular proximity based infeasible IPMs / 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: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity and other spectral relations for symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / 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: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank

Revision as of 07:32, 17 July 2024

scientific article
Language Label Description Also known as
English
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
scientific article

    Statements

    Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    0 references
    symmetric optimization
    0 references
    infeasible interior-point methods
    0 references
    Nesterov-Todd direction
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references