Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by one other user not shown)
label / enlabel / en
 
Primal-Dual Interior-Point Methods for Domain-Driven Formulations
Property / arXiv classification
 
math.OC
Property / arXiv classification: math.OC / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.06925 / 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: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Entropy Relaxations for Signomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative entropy optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: All convex invariant functions of hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy optimization and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient optimization of the quantum relative entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite approximations of the matrix logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems / 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: Q5251797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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: The mathematics of eigenvalue optimization / 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: Computational experience with 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for 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: 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: Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems / 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: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / 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: Generalization of primal-dual interior-point methods to convex optimization problems in conic form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / 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 09:54, 23 July 2024

scientific article; zbMATH DE number 7242696
Language Label Description Also known as
English
Primal-Dual Interior-Point Methods for Domain-Driven Formulations
scientific article; zbMATH DE number 7242696

    Statements

    0 references
    0 references
    1 September 2020
    0 references
    convex optimization
    0 references
    interior-point methods
    0 references
    primal-dual algorithms
    0 references
    duality theory
    0 references
    math.OC
    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