Strong duality and minimal representations for cone optimization (Q1928754): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Optimality Conditions and Recession Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Duality in Second Order and p -Order Cone Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice of faces of a finite dimensional cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces and duality in convex cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones, matrices and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set intersection theorems and existence of optimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of optimality without constraint qualification for the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Regularization for Degenerate Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating Homogeneous Cones and Positive Definite Cones via <i>T</i>-Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance and efficiency of convex representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nesterov's approach to semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing sparse semidefinite programs via matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable primal-dual approach for linear programming under nondegeneracy assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Central Path in Semidefinite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete characterizations of stable Farkas' lemma and cone-convex programming duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Approximations for Global Unconstrained Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5717954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence and nonexistence of Lagrange multipliers in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method" / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and second-order methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cone extreme points and faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Closedness of the Linear Image of a Closed Convex Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / 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: Linear programming, complexity theory and elementary functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Slater condition for the SDP relaxations of nonconvex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On point classification in convex sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and measuring instances of hard semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of optimization in matrix theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and stability for the mathematical programming problem in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: LMI Approximations for Cones of Positive Semidefinite Forms / rank
 
Normal rank

Latest revision as of 01:09, 6 July 2024

scientific article
Language Label Description Also known as
English
Strong duality and minimal representations for cone optimization
scientific article

    Statements

    Strong duality and minimal representations for cone optimization (English)
    0 references
    0 references
    0 references
    4 January 2013
    0 references
    cone optimization
    0 references
    duality
    0 references
    preprocessing
    0 references
    constraint qualification
    0 references
    duality gap
    0 references
    semidefinite programming
    0 references
    strict complementarity
    0 references
    nice cones
    0 references
    devious cones
    0 references
    facially dual complete cones
    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
    0 references
    0 references

    Identifiers