Regularizing the abstract convex program
From MaRDI portal
Cites work
- A simplified test for optimality
- A strengthened test for optimality
- Calculating the cone of directions of constancy
- Characterization of optimality in convex programming without a constraint qualification
- Characterizations of optimality in convex programming: the nondifferentiable case
- Characterizations of optimality without constraint qualification for the abstract convex program
- Combined phase I—phase II methods of feasible directions
- Cones of diagonally dominant matrices
- Extension of Newton's method to nonlinear functions with values in a cone
- Geometry of optimality conditions and constraint qualifications
- Geometry of optimality conditions and constraint qualifications: The convex case
- scientific article; zbMATH DE number 3698734 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 3737415 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3621473 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3399051 (Why is no real title available?)
- On state restrained linear-quadratic control problems
- State Constraints in Convex Control Problems of Bolza
- Strongly Regular Generalized Equations
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- The lattice of faces of a finite dimensional cone
Cited in
(71)- The extreme points of a set of positive semidefinite operators
- Projectionally exposed cones in \(R^ 3\)
- Some applications of optimization in matrix theory
- A strengthened test for optimality
- On the Slater condition for the SDP relaxations of nonconvex sets
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Strong duality and minimal representations for cone optimization
- Implicit optimality criterion for convex SIP problem with box constrained index set
- Generating and measuring instances of hard semidefinite programs
- Numerical algebraic geometry and semidefinite programming
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Strong duality for standard convex programs
- Dimension reduction for semidefinite programs via Jordan algebras
- Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction
- Lifts of non-compact convex sets and cone factorizations
- Amenable cones: error bounds without constraint qualifications
- Reduction of SISO H-infinity output feedback control problem
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- Approximate cone factorizations and lifts of polytopes
- A bound on the Carathéodory number
- Iterative methods for nonlinear complementarity problems on isotone projection cones
- A strengthened Barvinok-Pataki bound on SDP rank
- An exact explicit dual for the linear copositive programming problem
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- Embedding methods for semidefinite programming
- Implicit complementarity problems on isotone projection cones
- Bad semidefinite programs: they all look the same
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Understanding linear semi-infinite programming via linear programming over cones
- Facial reduction algorithms for conic optimization problems
- Necessary and sufficient conditions for regularity of constraints in convex programming
- Facial reduction and partial polyhedrality
- A framework for solving mixed-integer semidefinite programs
- Projectionally Exposed Cones
- Projection methods for quantum channel construction
- On Farkas lemma and dimensional rigidity of bar frameworks
- Solving SDP completely with an interior point oracle
- Characterizing bad semidefinite programs: normal forms and short proofs
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Preprocessing and regularization for degenerate semidefinite programs
- Error bounds and singularity degree in semidefinite programming
- Amenable cones are particularly nice
- Validating numerical semidefinite programming solvers for polynomial invariants
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Error bounds, facial residual functions and applications to the exponential cone
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- A facial reduction approach for the single source localization problem
- A note on the SDP relaxation of the minimum cut problem
- Revisiting degeneracy, strict feasibility, stability, in linear programming
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Self-Dual Polyhedral Cones and Their Slack Matrices
- Hyperbolicity cones are amenable
- A facial reduction algorithm for finding sparse SOS representations
- How Do Exponential Size Solutions Arise in Semidefinite Programming?
- Lagrangian duality in convex conic programming with simple proofs
- A regularized strong duality for nonsymmetric semidefinite least squares problem
- Certifying solutions of degenerate semidefinite programs
- Tight error bounds for log-determinant cones without constraint qualifications
- Linear copositive programming: strong dual formulations and their properties
- Non-facial exposedness of copositive cones over symmetric cones
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- Facial structure of copositive and completely positive cones over a second-order cone
- A study of projectionally exposed cones
- The minimal cone for conic linear programming
- Reformulating the disjunctive cut generating linear program
This page was built for publication: Regularizing the abstract convex program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156085)
