Regularizing the abstract convex program
From MaRDI portal
Publication:1156085
DOI10.1016/0022-247X(81)90138-4zbMATH Open0467.90076OpenAlexW2080359169MaRDI QIDQ1156085FDOQ1156085
Authors: Henry Wolkowicz, Jonathan M. Borwein 
Publication date: 1981
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(81)90138-4
algorithmcomplementarity problemminimal conecone of directionsabstract convex programoptimality characterizations
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48) General theory of locally convex spaces (46A03)
Cites Work
- Strongly Regular Generalized Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- State Constraints in Convex Control Problems of Bolza
- Extension of Newton's method to nonlinear functions with values in a cone
- The lattice of faces of a finite dimensional cone
- Combined phase I—phase II methods of feasible directions
- Title not available (Why is that?)
- Cones of diagonally dominant matrices
- Title not available (Why is that?)
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- A simplified test for optimality
- Characterizations of optimality without constraint qualification for the abstract convex program
- Geometry of optimality conditions and constraint qualifications: The convex case
- Geometry of optimality conditions and constraint qualifications
- Characterization of optimality in convex programming without a constraint qualification
- Title not available (Why is that?)
- Calculating the cone of directions of constancy
- Characterizations of optimality in convex programming: the nondifferentiable case
- Title not available (Why is that?)
- Title not available (Why is that?)
- On state restrained linear-quadratic control problems
- A strengthened test for optimality
Cited In (65)
- Error bounds, facial residual functions and applications to the exponential cone
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Amenable cones are particularly nice
- How Do Exponential Size Solutions Arise in Semidefinite Programming?
- Lagrangian duality in convex conic programming with simple proofs
- Revisiting degeneracy, strict feasibility, stability, in linear programming
- Hyperbolicity cones are amenable
- A framework for solving mixed-integer semidefinite programs
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- The extreme points of a set of positive semidefinite operators
- Implicit optimality criterion for convex SIP problem with box constrained index set
- Some applications of optimization in matrix theory
- Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Reformulating the disjunctive cut generating linear program
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- On the Slater condition for the SDP relaxations of nonconvex sets
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Understanding linear semi-infinite programming via linear programming over cones
- Projectionally exposed cones in \(R^ 3\)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Amenable cones: error bounds without constraint qualifications
- Reduction of SISO H-infinity output feedback control problem
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Preprocessing and regularization for degenerate semidefinite programs
- Numerical algebraic geometry and semidefinite programming
- Facial reduction algorithms for conic optimization problems
- Projectionally Exposed Cones
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- A bound on the Carathéodory number
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Strong duality and minimal representations for cone optimization
- Self-Dual Polyhedral Cones and Their Slack Matrices
- Characterizing bad semidefinite programs: normal forms and short proofs
- Embedding methods for semidefinite programming
- A strengthened test for optimality
- Necessary and sufficient conditions for regularity of constraints in convex programming
- A facial reduction approach for the single source localization problem
- A study of projectionally exposed cones
- Generating and measuring instances of hard semidefinite programs
- An exact explicit dual for the linear copositive programming problem
- Error bounds and singularity degree in semidefinite programming
- A strengthened Barvinok-Pataki bound on SDP rank
- The minimal cone for conic linear programming
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Iterative methods for nonlinear complementarity problems on isotone projection cones
- A regularized strong duality for nonsymmetric semidefinite least squares problem
- Projection methods for quantum channel construction
- Validating numerical semidefinite programming solvers for polynomial invariants
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Implicit complementarity problems on isotone projection cones
- Strong duality for standard convex programs
- On Farkas lemma and dimensional rigidity of bar frameworks
- A note on the SDP relaxation of the minimum cut problem
- Solving SDP completely with an interior point oracle
- Lifts of non-compact convex sets and cone factorizations
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- A facial reduction algorithm for finding sparse SOS representations
- Dimension reduction for semidefinite programs via Jordan algebras
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Bad semidefinite programs: they all look the same
- Facial reduction and partial polyhedrality
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Approximate cone factorizations and lifts of polytopes
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)
