Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DDS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3173759678 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1901.07084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex optimization problems involving finite autocorrelation sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the behavior of the homogeneous self-dual model for conic convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Domain-Driven Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A little theorem of the big \({\mathcal M}\) in interior point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs / 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: Computational experience with a primal-dual interior point method for linear 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: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / 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: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards non-symmetric conic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / 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: It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-potential infeasible-start interior-point algorithm with computational experiments and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homogeneous interior-point algorithm for nonsymmetric convex conic optimization / 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: Q5482452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 / 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: Strong duality and minimal representations for cone optimization / 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: 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 Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: User'S guide To Lipsol linear-programming interior point solvers V0.4 / rank
 
Normal rank

Latest revision as of 11:39, 29 July 2024

scientific article
Language Label Description Also known as
English
Status determination by interior-point methods for convex optimization problems in domain-driven form
scientific article

    Statements

    Status determination by interior-point methods for convex optimization problems in domain-driven form (English)
    0 references
    0 references
    0 references
    29 June 2022
    0 references
    convex optimization
    0 references
    interior-point methods
    0 references
    primal-dual algorithms
    0 references
    duality theory
    0 references
    status determination
    0 references
    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
    0 references