Regularizing the abstract convex program

DOI10.1016/0022-247X(81)90138-4zbMath0467.90076OpenAlexW2080359169MaRDI QIDQ1156085

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

zbMATH Keywords

algorithm complementarity problem minimal cone cone of directions abstract convex program optimality characterizations

Mathematics Subject Classification ID

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)

Related Items

Embedding methods for semidefinite programming, Reformulating the disjunctive cut generating linear program, Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank, Implicit complementarity problems on isotone projection cones, The extreme points of a set of positive semidefinite operators, Projectionally exposed cones in \(R^ 3\), A bound on the Carathéodory number, Facial reduction algorithms for conic optimization problems, A strengthened Barvinok-Pataki bound on SDP rank, Strong duality and minimal representations for cone optimization, A facial reduction algorithm for finding sparse SOS representations, Facial Reduction and Partial Polyhedrality, 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, Dimension reduction for semidefinite programs via Jordan algebras, A facial reduction approach for the single source localization problem, A note on the SDP relaxation of the minimum cut problem, An exact explicit dual for the linear copositive programming problem, Revisiting degeneracy, strict feasibility, stability, in linear programming, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Implicit optimality criterion for convex SIP problem with box constrained index set, Self-Dual Polyhedral Cones and Their Slack Matrices, Hyperbolicity cones are amenable, Necessary and sufficient conditions for regularity of constraints in convex programming, A simplified treatment of Ramana's exact dual for semidefinite programming, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Lagrangian duality in convex conic programming with simple proofs, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Some applications of optimization in matrix theory, A strengthened test for optimality, A regularized strong duality for nonsymmetric semidefinite least squares problem, Generating and measuring instances of hard semidefinite programs, 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, Exact algorithms for semidefinite programs with degenerate feasible set, A framework for solving mixed-integer semidefinite programs, Numerical algebraic geometry and semidefinite programming, Projection methods for quantum channel construction, On Farkas lemma and dimensional rigidity of bar frameworks, Preprocessing and Regularization for Degenerate Semidefinite Programs, Validating numerical semidefinite programming solvers for polynomial invariants, Perturbation analysis of singular semidefinite programs and its applications to control problems, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, Douglas-Rachford splitting and ADMM for pathological convex optimization, Understanding linear semi-infinite programming via linear programming over cones, Iterative methods for nonlinear complementarity problems on isotone projection cones, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Perturbed sums-of-squares theorem for polynomial optimization and its applications, A study of projectionally exposed cones, Projectionally Exposed Cones, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs, The minimal cone for conic linear programming, Strong duality for standard convex programs, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Solving SDP completely with an interior point oracle, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, Error Bounds and Singularity Degree in Semidefinite Programming, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices, Approximate cone factorizations and lifts of polytopes, Amenable Cones Are Particularly Nice, On the Slater condition for the SDP relaxations of nonconvex sets, Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach

Cites Work