On the public citation graph
An exact duality theory for semidefinite programming and its complexity implications
0 signed · 211 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-1148-8openalex-snapshot
An Introduction to Convex Polytopes
inferredcites →https://doi.org/10.1007/978-1-4684-9369-6openalex-snapshot
Geometric Functional Analysis and its Applications
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01100204openalex-snapshot
Some geometric results in semidefinite programming
inferredcites →https://doi.org/10.1016/0012-365x(94)90241-0openalex-snapshot
Fractional isomorphism of graphs
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0022-247x(81)90138-4openalex-snapshot
Regularizing the abstract convex program
inferredcites →https://doi.org/10.1016/0024-3795(81)90143-9openalex-snapshot
Some applications of optimization in matrix theory
inferredcites →https://doi.org/10.1016/s0304-0208(08)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferredcites →https://doi.org/10.1023/a:1008203903341openalex-snapshot
On the Complexity of Semidefinite Programs
inferredcites →https://doi.org/10.1090/s0273-0979-1989-15750-9openalex-snapshot
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
inferredcites →https://doi.org/10.1137/0331064openalex-snapshot
An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
inferredcites →https://doi.org/10.1137/0802007openalex-snapshot
Large-Scale Optimization of Eigenvalues
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/1.9781611970777openalex-snapshot
Linear Matrix Inequalities in System and Control Theory
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s1052623495288350openalex-snapshot
Strong Duality for Semidefinite Programming
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02390openalex-snapshot
Semi‐Definite Programming
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_448openalex-snapshot
Semi-Infinite Programming, Semidefinite Programming and Perfect Duality
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_5openalex-snapshot
Interior Point and Semidefinite Approaches in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/3-540-46043-8_107openalex-snapshot
A Subspace Semidefinite Programming for Spectral Graph Partitioning
inferred← citeshttps://doi.org/10.1007/978-0-387-35514-6_13openalex-snapshot
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_1openalex-snapshot
Introduction to Semidefinite, Conic and Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-7621-4_12openalex-snapshot
Preprocessing and Regularization for Degenerate Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-1-4614-7621-4_28openalex-snapshot
Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_590-1openalex-snapshot
Semi-Infinite Programming, Semidefinite Programming, and Perfect Duality
inferred← citeshttps://doi.org/10.1007/978-3-031-38659-6openalex-snapshot
Polynomial Optimization, Moments, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-38659-6_3openalex-snapshot
Symmetries in Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-06924-5_3openalex-snapshot
General Complementarity Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_7openalex-snapshot
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-08377-3_2openalex-snapshot
The Orthogonal Complement of Faces for Cones Associated with the Cone of Positive Semidefinite Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-18842-3_2openalex-snapshot
Basic Properties of Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-18842-3_4openalex-snapshot
Duality and Complementarity
inferred← citeshttps://doi.org/10.1007/978-3-319-33338-0_1openalex-snapshot
Selected Results from Algebra and Mathematical Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-70566-8_30openalex-snapshot
Some Recent Developments in Spectrahedral Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_34openalex-snapshot
Counterexample-Guided Refinement of Template Polyhedra
inferred← citeshttps://doi.org/10.1007/978-4-431-55060-0_24openalex-snapshot
Strict Feasibility of Conic Optimization Problems
inferred← citeshttps://doi.org/10.1007/bf01100204openalex-snapshot
Some geometric results in semidefinite programming
inferred← citeshttps://doi.org/10.1007/bf02614320openalex-snapshot
Cuts, matrix completions and graph rigidity
inferred← citeshttps://doi.org/10.1007/pl00011370openalex-snapshot
Optimality conditions for nonconvex semidefinite programming
inferred← citeshttps://doi.org/10.1007/s00186-021-00761-xopenalex-snapshot
Strong duality for standard convex programs
inferred← citeshttps://doi.org/10.1007/s00454-014-9590-9openalex-snapshot
Characterizing the Universal Rigidity of Generic Frameworks
inferred← citeshttps://doi.org/10.1007/s00454-015-9670-5openalex-snapshot
Iterative Universal Rigidity
inferred← citeshttps://doi.org/10.1007/s00454-015-9695-9openalex-snapshot
Three-Monotone Interpolation
inferred← citeshttps://doi.org/10.1007/s00454-016-9836-9openalex-snapshot
Universal Rigidity of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s10100-007-0052-9openalex-snapshot
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
inferred← citeshttps://doi.org/10.1007/s10107-003-0470-yopenalex-snapshot
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
inferred← citeshttps://doi.org/10.1007/s10107-011-0505-8openalex-snapshot
The tracial moment problem and trace-optimization of polynomials
inferred← citeshttps://doi.org/10.1007/s10107-017-1136-5openalex-snapshot
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
inferred← citeshttps://doi.org/10.1007/s10107-017-1169-9openalex-snapshot
Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
inferred← citeshttps://doi.org/10.1007/s10107-018-1250-zopenalex-snapshot
Statistical inference of semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-022-01818-3openalex-snapshot
Complexity, exactness, and rationality in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-022-01891-8openalex-snapshot
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
inferred← citeshttps://doi.org/10.1007/s10208-022-09552-0openalex-snapshot
An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone
inferred← citeshttps://doi.org/10.1007/s10288-011-0170-zopenalex-snapshot
The minimal cone for conic linear programming
inferred← citeshttps://doi.org/10.1007/s10589-012-9480-0openalex-snapshot
Strong duality and minimal representations for cone optimization
inferred← citeshttps://doi.org/10.1007/s10898-006-9088-yopenalex-snapshot
A finite steps algorithm for solving convex feasibility problems
inferred← citeshttps://doi.org/10.1007/s10898-021-00995-3openalex-snapshot
On strong duality in linear copositive programming
inferred← citeshttps://doi.org/10.1007/s10898-022-01188-2openalex-snapshot
A facial reduction approach for the single source localization problem
inferred← citeshttps://doi.org/10.1007/s10957-004-1712-8openalex-snapshot
Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-012-0219-yopenalex-snapshot
Facial Reduction Algorithms for Conic Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-019-01575-yopenalex-snapshot
Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10957-025-02922-yopenalex-snapshot
Semidefinite Network Games: Multiplayer Minimax and Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10958-012-0734-2openalex-snapshot
Optimality criteria without constraint qualifications for linear semidefinite problems
inferred← citeshttps://doi.org/10.1007/s11228-019-00527-yopenalex-snapshot
Immobile Indices and CQ-Free Optimality Criteria for Linear Copositive Programming Problems
inferred← citeshttps://doi.org/10.1007/s11590-006-0038-xopenalex-snapshot
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
inferred← citeshttps://doi.org/10.1007/s11590-022-01870-0openalex-snapshot
An exact explicit dual for the linear copositive programming problem
inferred← citeshttps://doi.org/10.1007/s11590-022-01898-2openalex-snapshot
A simplified treatment of Ramana’s exact dual for semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11750-011-0189-5openalex-snapshot
Implicit optimality criterion for convex SIP problem with box constrained index set
inferred← citeshttps://doi.org/10.1007/s11750-014-0319-yopenalex-snapshot
Farkas’ lemma: three decades of generalizations for mathematical optimization
inferred← citeshttps://doi.org/10.1007/s12190-017-1128-xopenalex-snapshot
An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
inferred← citeshttps://doi.org/10.1007/s43069-023-00279-4openalex-snapshot
Lagrangian Duality in Convex Conic Programming with Simple Proofs
inferred← citeshttps://doi.org/10.1016/j.aam.2024.102670openalex-snapshot
On the complexity of analyticity in semi-definite optimization
inferred← citeshttps://doi.org/10.1016/j.aim.2021.108119openalex-snapshot
Complexity aspects of local minima and related notions
inferred← citeshttps://doi.org/10.1016/j.ces.2025.122347openalex-snapshot
A review on model-based design of experiments for parameter precision – Open challenges, trends and future perspectives
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2020.107164openalex-snapshot
Scalable computation of intracellular metabolite concentrations
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.023openalex-snapshot
Semidefinite programming and arithmetic circuit evaluation
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100021openalex-snapshot
Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.08.014openalex-snapshot
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.09.443openalex-snapshot
Application of Facial Reduction to H∞ State Feedback Control Problem∗∗The first author was supported by JSPS KAKENHI Grant Numbers 22740056 and 26400203.
inferred← citeshttps://doi.org/10.1016/j.jpaa.2009.07.003openalex-snapshot
Semidefinite programming and sums of hermitian squares of noncommutative polynomials
inferred← citeshttps://doi.org/10.1016/j.jpaa.2020.106605openalex-snapshot
Conic programming: Infeasibility certificates and projective geometry
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.07.002openalex-snapshot
Solving generic nonarchimedean semidefinite programs using stochastic game algorithms
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.11.001openalex-snapshot
Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set
inferred← citeshttps://doi.org/10.1016/j.jsc.2023.03.001openalex-snapshot
Reflection groups and cones of sums of squares
inferred← citeshttps://doi.org/10.1016/j.laa.2014.03.015openalex-snapshot
Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property
inferred← citeshttps://doi.org/10.1016/j.laa.2020.09.034openalex-snapshot
Reduction of SISO H-infinity output feedback control problem
inferred← citeshttps://doi.org/10.1016/j.laa.2026.08.010openalex-snapshot
Refined estimates on the dimensions of maximal faces of completely positive cones
inferred← citeshttps://doi.org/10.1016/j.orl.2019.12.003openalex-snapshot
On polyhedral and second-order cone decompositions of semidefinite optimization problems
inferred← citeshttps://doi.org/10.1016/j.rinam.2021.100166openalex-snapshot
Numerical algebraic geometry and semidefinite programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.013openalex-snapshot
Tractability conditions for numeric CSPs
inferred← citeshttps://doi.org/10.1016/s0024-3795(03)00664-5openalex-snapshot
Semidefinite programming and matrix scaling over the semidefinite cone
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00011-4openalex-snapshot
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00143-6openalex-snapshot
Semidefinite programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1017/9781107337534openalex-snapshot
Complexity of Infinite-Domain Constraint Satisfaction
inferred← citeshttps://doi.org/10.1023/a:1008203903341openalex-snapshot
On the Complexity of Semidefinite Programs
inferred← citeshttps://doi.org/10.1038/s41467-024-50074-wopenalex-snapshot
Evolving scientific discovery by unifying data and background knowledge with AI Hilbert
inferred← citeshttps://doi.org/10.1051/ro/2018034openalex-snapshot
A guide to conic optimisation and its applications
inferred← citeshttps://doi.org/10.1080/00207179.2017.1351625openalex-snapshot
Application of facial reduction to H ∞ state feedback control problem
inferred← citeshttps://doi.org/10.1080/00949655.2011.579970openalex-snapshot
A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling
inferred← citeshttps://doi.org/10.1080/02331930310001611484openalex-snapshot
Duality for semi-definite and semi-infinite programming
inferred← citeshttps://doi.org/10.1080/02331934.2011.625027openalex-snapshot
Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap
inferred← citeshttps://doi.org/10.1080/02331934.2020.1822835openalex-snapshot
Refining the partition for multifold conic optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2022.2027939openalex-snapshot
On equivalent representations and properties of faces of the cone of copositive matrices
inferred← citeshttps://doi.org/10.1080/02331934.2023.2251987openalex-snapshot
Strong duality of a conic optimization problem with a single hyperplane and two cone constraints
inferred← citeshttps://doi.org/10.1080/03081087.2023.2212316openalex-snapshot
The truncated moment problem on curves y = q ( x ) and yx ℓ = 1
inferred← citeshttps://doi.org/10.1080/03155986.2019.1572853openalex-snapshot
On the identification of the optimal partition for semidefinite optimization
inferred← citeshttps://doi.org/10.1080/10556788.2010.534475openalex-snapshot
Embedding methods for semidefinite programming
inferred← citeshttps://doi.org/10.1080/10556788.2017.1288729openalex-snapshot
A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
inferred← citeshttps://doi.org/10.1080/10556788.2018.1528249openalex-snapshot
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
inferred← citeshttps://doi.org/10.1080/10556788.2020.1850720openalex-snapshot
Solving SDP completely with an interior point oracle
inferred← citeshttps://doi.org/10.1080/10556788.2024.2409710openalex-snapshot
Closing duality gaps of SDPs completely through perturbation when singularity degree is one
inferred← citeshttps://doi.org/10.1080/10556789808805692openalex-snapshot
Copositive realxation for genera quadratic programming
inferred← citeshttps://doi.org/10.1103/physrevlett.130.240601openalex-snapshot
Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919776openalex-snapshot
Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions
inferred← citeshttps://doi.org/10.1109/ccc.2006.30openalex-snapshot
On the Complexity of Numerical Analysis
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717988openalex-snapshot
A cutting-plane method for Mixed-Logical Semidefinite Programs with an application to multi-vehicle robust path planning
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312663openalex-snapshot
Correct-by-Construction Barrier Certificate Synthesis for Safety Verification of Continuous Dynamical Systems
inferred← citeshttps://doi.org/10.1109/cso.2010.139openalex-snapshot
Self-Dual Embedding for SDP Using ELSD and its Lagrangian Dual
inferred← citeshttps://doi.org/10.1109/tac.2024.3462532openalex-snapshot
Second Moment Polytopic Systems: Generalization of Uncertain Stochastic Linear Dynamics
inferred← citeshttps://doi.org/10.1109/tcns.2020.3007821openalex-snapshot
Admissibility of Uncertain Injections in Quadratic Algebraic Systems
inferred← citeshttps://doi.org/10.1111/acfi.12543openalex-snapshot
Financial applications of semidefinite programming: a review and call for interdisciplinary research
inferred← citeshttps://doi.org/10.1111/j.1467-9574.1996.tb01485.xopenalex-snapshot
Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
inferred← citeshttps://doi.org/10.1126/science.1110063openalex-snapshot
Marked Decline in Atmospheric Carbon Dioxide Concentrations During the Paleogene
inferred← citeshttps://doi.org/10.1137/050622560openalex-snapshot
On the Minimum Volume Covering Ellipsoid of Ellipsoids
inferred← citeshttps://doi.org/10.1137/1.9780898718829.ch4openalex-snapshot
4. Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/120874898openalex-snapshot
Containment Problems for Polytopes and Spectrahedra
inferred← citeshttps://doi.org/10.1137/140968318openalex-snapshot
Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
inferred← citeshttps://doi.org/10.1137/140971634openalex-snapshot
A Semidefinite Hierarchy for Containment of Spectrahedra
inferred← citeshttps://doi.org/10.1137/140972354openalex-snapshot
Exact Duality in Semidefinite Programming Based on Elementary Reformulations
inferred← citeshttps://doi.org/10.1137/15m103114xopenalex-snapshot
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/15m1041924openalex-snapshot
Bad Semidefinite Programs: They All Look the Same
inferred← citeshttps://doi.org/10.1137/17m1126643openalex-snapshot
Facially Dual Complete (Nice) Cones and Lexicographic Tangents
inferred← citeshttps://doi.org/10.1137/17m1140844openalex-snapshot
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
inferred← citeshttps://doi.org/10.1137/20m133717xopenalex-snapshot
Second-Order Cone Representation for Convex Sets in the Plane
inferred← citeshttps://doi.org/10.1137/21m1419933openalex-snapshot
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
inferred← citeshttps://doi.org/10.1137/21m1434945openalex-snapshot
How Do Exponential Size Solutions Arise in Semidefinite Programming?
inferred← citeshttps://doi.org/10.1137/24m1638628openalex-snapshot
Semidefinite Programming and Linear Equations vs. Homomorphism Problems
inferred← citeshttps://doi.org/10.1137/s0895479899352689openalex-snapshot
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
inferred← citeshttps://doi.org/10.1137/s1052623495288350openalex-snapshot
Strong Duality for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623498338606openalex-snapshot
Error Bounds for Linear Matrix Inequalities
inferred← citeshttps://doi.org/10.1142/s0219265907001898openalex-snapshot
FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
inferred← citeshttps://doi.org/10.1145/2090236.2090259openalex-snapshot
Quantum interactive proofs with weak error bounds
inferred← citeshttps://doi.org/10.1145/2930889.2930935openalex-snapshot
Solving Generic Nonarchimedean Semidefinite Programs Using Stochastic Game Algorithms
inferred← citeshttps://doi.org/10.1145/3519935.3520063openalex-snapshot
On the complexity of CSP-based ideal membership problems
inferred← citeshttps://doi.org/10.1145/3597066.3597075openalex-snapshot
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
inferred← citeshttps://doi.org/10.1145/3798129.3800760openalex-snapshot
Hesse’s Redemption: Efficient Convex Polynomial Programming
inferred← citeshttps://doi.org/10.1201/b10839-13openalex-snapshot
Numerical Analysis of Cable Networks
inferred← citeshttps://doi.org/10.1214/15-aap1104openalex-snapshot
Randomized interior point methods for sampling and optimization
inferred← citeshttps://doi.org/10.1287/moor.1060.0242openalex-snapshot
On the Closedness of the Linear Image of a Closed Convex Cone
inferred← citeshttps://doi.org/10.1287/moor.1080.0339openalex-snapshot
On Zero Duality Gap and the Farkas Lemma for Conic Programming
inferred← citeshttps://doi.org/10.1287/moor.1120.0584openalex-snapshot
An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
inferred← citeshttps://doi.org/10.1287/moor.2021.1234openalex-snapshot
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
inferred← citeshttps://doi.org/10.1287/moor.2022.1290openalex-snapshot
Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph
inferred← citeshttps://doi.org/10.1287/opre.2024.1137openalex-snapshot
A Low-Rank Augmented Lagrangian Method for Doubly Nonnegative Relaxations of Mixed-Binary Quadratic Programs
inferred← citeshttps://doi.org/10.14317/jami.2015.229openalex-snapshot
ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION
inferred← citeshttps://doi.org/10.14760/owp-2011-28openalex-snapshot
Infeasibility certificates for linear matrix inequalities
inferred← citeshttps://doi.org/10.1515/ijnsns.2001.2.2.139openalex-snapshot
Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
inferred← citeshttps://doi.org/10.15807/jorsj.54.161openalex-snapshot
AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL( SCOPE (Seminar on Computation and OPtimization for new Extensions))
inferred← citeshttps://doi.org/10.15807/jorsj.59.241openalex-snapshot
A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
inferred← citeshttps://doi.org/10.1590/0101-7438.2014.034.03.0495openalex-snapshot
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
inferred← citeshttps://doi.org/10.17615/fk92-1x19openalex-snapshot
Exact Duality in Semidefinite Programming Based on Elementary Reformulations
inferred← citeshttps://doi.org/10.17615/kph8-3c84openalex-snapshot
Elementary reformulation and succinct certificates in conic linear programming
inferred← citeshttps://doi.org/10.23952/cot.2023.3openalex-snapshot
Linear copositive programming: Strong dual formulations and their properties
inferred← citeshttps://doi.org/10.23952/jnva.8.2024.4.05openalex-snapshot
A polyhedral approximation algorithm for recession cones of spectrahedral shadows
inferred← citeshttps://doi.org/10.25911/5f1ead734c341openalex-snapshot
Non-negative Polynomials, Sums of Squares & The Moment Problem
inferred← citeshttps://doi.org/10.31274/td-20240617-63openalex-snapshot
Coloring problems in graph theory: k-packings and (p,q)-colorings
inferred← citeshttps://doi.org/10.3233/sat190001openalex-snapshot
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
inferred← citeshttps://doi.org/10.33581/2520-6508-2020-3-17-27openalex-snapshot
Linear semidefinite programming problems: regularisation and strong dual formulations
inferred← citeshttps://doi.org/10.3390/math9212698openalex-snapshot
Structural Properties of Faces of the Cone of Copositive Matrices
inferred← citeshttps://doi.org/10.3934/jimo.2010.6.881openalex-snapshot
Duality formulations in semidefinite programming
inferred← citeshttps://doi.org/10.4171/022-1/17openalex-snapshot
Advances in convex optimization: conic programming
inferred← citeshttps://doi.org/10.4230/dagsemproc.06111.12openalex-snapshot
On the Complexity of Numerical Analysis
inferred← citeshttps://doi.org/10.4230/lipics.csl.2017.42openalex-snapshot
An Algebraic Approach to Valued Constraint Satisfaction
inferred← citeshttps://doi.org/10.4310/cms.2014.v12.n7.a11openalex-snapshot
Conditions for existence of dual certificates in rank-one semidefinite problems
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5568openalex-snapshot
Duality Gap, Computational Complexity and NP Completeness: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4367openalex-snapshot
Deciding polyhedrality of spectrahedra
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6602openalex-snapshot
Complexity of the positive semidefinite matrix completion problem with a rank constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2390openalex-snapshot
Completely Positive formulation of the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1534openalex-snapshot
Algorithms in Real Algebraic Geometry: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02278openalex-snapshot
Universal Rigidity of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1509.02735openalex-snapshot
Containment Problems for Projections of Polyhedra and Spectrahedra
inferred← citeshttps://doi.org/10.48550/arxiv.1710.07410openalex-snapshot
Complete Facial Reduction in One Step for Spectrahedra
inferred← citeshttps://doi.org/10.48550/arxiv.1804.00386openalex-snapshot
Refining the partition for multifold conic optimization problems
inferred← citeshttps://doi.org/10.48550/arxiv.1806.09408openalex-snapshot
Transmission-Constrained Unit Commitment
inferred← citeshttps://doi.org/10.48550/arxiv.1809.10340openalex-snapshot
An oracle-based projection and rescaling algorithm for linear semi-infinite feasibility problems and its application to SDP and SOCP
inferred← citeshttps://doi.org/10.48550/arxiv.1812.11796openalex-snapshot
On Positive Duality Gaps in Semidefinite Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2004.04196openalex-snapshot
Second-order cone representation for convex subsets of the plane
inferred← citeshttps://doi.org/10.48550/arxiv.2004.09865openalex-snapshot
Strong duality for a problem of linear copositive programming
inferred← citeshttps://doi.org/10.48550/arxiv.2008.12170openalex-snapshot
Complexity Aspects of Fundamental Questions in Polynomial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2009.06550openalex-snapshot
On strong duality, theorems of the alternative, and projections in conic optimization
inferred← citeshttps://doi.org/10.5821/dissertation-2117-366561openalex-snapshot
Size bounds for algebraic and semialgebraic proof systems
inferred← citeshttps://doi.org/10.70675/355d0679zdae2z42d3za970za4e69ef8a144openalex-snapshot
Tropical spectrahedra : Application to semidefinite programming and mean payoff games
inferred← citeshttps://doi.org/10.70675/562d6294z3740z4f80z9c00z3d4d297d74cbopenalex-snapshot
Algorithmic configuration by learning and optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.