On the public citation graph
A recipe for semidefinite relaxation for (0,1)-quadratic programming
0 signed · 195 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/bf01581273openalex-snapshot
A lift-and-project cutting plane algorithm for mixed 0–1 programs
inferredcites →https://doi.org/10.1007/bf01585184openalex-snapshot
Laplacian eigenvalues and the maximum cut problem
inferredcites →https://doi.org/10.1007/bf02032130openalex-snapshot
A projection technique for partitioning the nodes of a graph
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
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/0166-218x(92)00119-7openalex-snapshot
On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems
inferredcites →https://doi.org/10.1016/0377-2217(84)90093-6openalex-snapshot
Quadratic assignment problems
inferredcites →https://doi.org/10.1016/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1080/02331938808843386openalex-snapshot
A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1
inferredcites →https://doi.org/10.1080/02331939208843863openalex-snapshot
Remarks on a difficult test problem for quadratic boolean programming
inferredcites →https://doi.org/10.1090/dimacs/016/01openalex-snapshot
The quadratic assignment problem: A survey and recent developments
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1109/tit.1979.1056027openalex-snapshot
On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
inferredcites →https://doi.org/10.1109/tit.1979.1056072openalex-snapshot
A comparison of the Delsarte and Lovász bounds
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/0805016openalex-snapshot
Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1287/moor.20.3.550openalex-snapshot
Convex Relaxations of (0, 1)-Quadratic 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.1002/9781118600245.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1002/9781119005216.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_477openalex-snapshot
Solving Large Scale And Sparse Semidefinite Programs
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/11561071_75openalex-snapshot
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/11585978_12openalex-snapshot
Probabilistic Subgraph Matching Based on Convex Relaxation
inferred← citeshttps://doi.org/10.1007/11776178_24openalex-snapshot
Optimal Placement and Selection of Camera Network Nodes for Target Localization
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-0-387-74759-0_627openalex-snapshot
Solving Large Scale and Sparse Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_6openalex-snapshot
SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_3openalex-snapshot
Connections between Nonlinear Programming and Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3335-7_8openalex-snapshot
SQ2P, Sequential Quadratic Constrained Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_28openalex-snapshot
Computational Approaches to Max-Cut
inferred← citeshttps://doi.org/10.1007/978-1-4615-6281-8_15openalex-snapshot
Semidefinite Programming Relaxations of Non-Convex Problems in Control and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_28openalex-snapshot
Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3155-2_7openalex-snapshot
Semidefinite Programming Approaches to the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_4openalex-snapshot
The Boolean Quadric Polytope
inferred← citeshttps://doi.org/10.1007/978-3-540-69995-8_35openalex-snapshot
Modelling Some Robust Design Problems via Conic Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_18openalex-snapshot
A New Approach to the Stable Set Problem Based on Ellipsoids
inferred← citeshttps://doi.org/10.1007/bf02614319openalex-snapshot
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
inferred← citeshttps://doi.org/10.1007/bf02614438openalex-snapshot
A semidefinite framework for trust region subproblems with applications to large scale minimization
inferred← citeshttps://doi.org/10.1007/pl00011394openalex-snapshot
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
inferred← citeshttps://doi.org/10.1007/s10107-003-0500-9openalex-snapshot
Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
inferred← citeshttps://doi.org/10.1007/s10107-005-0637-9openalex-snapshot
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0692-2openalex-snapshot
On the gap between the quadratic integer programming problem and its semidefinite relaxation
inferred← citeshttps://doi.org/10.1007/s10107-009-0275-8openalex-snapshot
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
inferred← citeshttps://doi.org/10.1007/s10107-011-0462-2openalex-snapshot
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
inferred← citeshttps://doi.org/10.1007/s10107-012-0515-1openalex-snapshot
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-012-0593-0openalex-snapshot
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
inferred← citeshttps://doi.org/10.1007/s10107-012-0594-zopenalex-snapshot
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality
inferred← citeshttps://doi.org/10.1007/s10107-012-0609-9openalex-snapshot
Unbounded convex sets for non-convex mixed-integer quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-012-0628-6openalex-snapshot
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0–1 quadratic problems leading to quasi-Newton methods
inferred← citeshttps://doi.org/10.1007/s10107-015-0866-5openalex-snapshot
Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
inferred← citeshttps://doi.org/10.1007/s101070100246openalex-snapshot
Strengthening the Lov�sz bound for graph coloring
inferred← citeshttps://doi.org/10.1007/s101070100279openalex-snapshot
Solving a class of semidefinite programs via nonlinear programming
inferred← citeshttps://doi.org/10.1007/s10107980012aopenalex-snapshot
Approximating quadratic programming with bound and quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10288-006-0011-7openalex-snapshot
Partial Lagrangian relaxation for general quadratic programming
inferred← citeshttps://doi.org/10.1007/s10479-005-3973-5openalex-snapshot
“Miniaturized” Linearizations for Quadratic 0/1 Problems
inferred← citeshttps://doi.org/10.1007/s10479-007-0169-1openalex-snapshot
The omnipresence of Lagrange
inferred← citeshttps://doi.org/10.1007/s10479-024-05887-9openalex-snapshot
On the benefits of a new continuous reformulation for QUBO problems
inferred← citeshttps://doi.org/10.1007/s10589-020-00231-wopenalex-snapshot
T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10589-025-00672-1openalex-snapshot
Quadratic convex reformulations for a class of complex quadratic programming problems
inferred← citeshttps://doi.org/10.1007/s10732-019-09433-wopenalex-snapshot
The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems
inferred← citeshttps://doi.org/10.1007/s10878-004-4838-6openalex-snapshot
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems
inferred← citeshttps://doi.org/10.1007/s10898-006-9128-7openalex-snapshot
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method
inferred← citeshttps://doi.org/10.1007/s10898-007-9155-zopenalex-snapshot
New bounds on the unconstrained quadratic integer programming problem
inferred← citeshttps://doi.org/10.1007/s10898-007-9161-1openalex-snapshot
The spherical constraint in Boolean quadratic programs
inferred← citeshttps://doi.org/10.1007/s10898-009-9507-yopenalex-snapshot
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
inferred← citeshttps://doi.org/10.1007/s10898-010-9630-9openalex-snapshot
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
inferred← citeshttps://doi.org/10.1007/s10898-011-9683-4openalex-snapshot
On duality gap in binary quadratic programming
inferred← citeshttps://doi.org/10.1007/s10898-014-0164-4openalex-snapshot
Parametric Lagrangian dual for the binary quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s10898-014-0195-xopenalex-snapshot
Conic approximation to nonconvex quadratic programming with convex quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10898-018-0676-4openalex-snapshot
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-011-9980-6openalex-snapshot
A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World
inferred← citeshttps://doi.org/10.1007/s10957-018-1416-0openalex-snapshot
Enhancing Semidefinite Relaxation for Quadratically Constrained Quadratic Programming via Penalty Methods
inferred← citeshttps://doi.org/10.1007/s11277-014-1639-9openalex-snapshot
Novel Algorithms for Quadratic Programming by Using Hypergraph Representations
inferred← citeshttps://doi.org/10.1007/s11590-013-0647-0openalex-snapshot
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
inferred← citeshttps://doi.org/10.1007/s11590-013-0676-8openalex-snapshot
A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-63428-3.50060-6openalex-snapshot
Testing the Non-Diagonal Quadratic Convex Reformulation Technique
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109564openalex-snapshot
Distributed resource allocation with binary decisions via Newton-like Neural Network dynamics
inferred← citeshttps://doi.org/10.1016/j.cam.2003.08.012openalex-snapshot
Best ellipsoidal relaxation to solve a nonconvex problem
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108820openalex-snapshot
Stability improvement for index tracking during a healthcare crisis using a dual decomposition approach
inferred← citeshttps://doi.org/10.1016/j.cor.2014.09.008openalex-snapshot
Generating cutting planes for the semidefinite relaxation of quadratic programs
inferred← citeshttps://doi.org/10.1016/j.cor.2015.07.008openalex-snapshot
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
inferred← citeshttps://doi.org/10.1016/j.cor.2019.104769openalex-snapshot
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems
inferred← citeshttps://doi.org/10.1016/j.cviu.2008.05.010openalex-snapshot
Improved spectral relaxation methods for binary quadratic optimization problems
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.028openalex-snapshot
A linearization framework for unconstrained quadratic (0-1) problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.10.002openalex-snapshot
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100622openalex-snapshot
EXPEDIS: An exact penalty method over discrete sets
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100661openalex-snapshot
Valid inequalities for quadratic optimisation with domain constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.03.025openalex-snapshot
Mathematical optimization ideas for biodiversity conservation
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.02.027openalex-snapshot
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
inferred← citeshttps://doi.org/10.1016/j.ins.2015.07.060openalex-snapshot
A semi-supervised random vector functional-link network based on the transductive framework
inferred← citeshttps://doi.org/10.1016/j.jsc.2023.102258openalex-snapshot
Invariants of SDP exactness in quadratic programming
inferred← citeshttps://doi.org/10.1016/j.orl.2008.12.009openalex-snapshot
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
inferred← citeshttps://doi.org/10.1016/j.orl.2015.05.001openalex-snapshot
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
inferred← citeshttps://doi.org/10.1016/j.orl.2017.10.007openalex-snapshot
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
inferred← citeshttps://doi.org/10.1016/j.sigpro.2009.04.025openalex-snapshot
Using the eigenvalue relaxation for binary least-squares estimation problems
inferred← citeshttps://doi.org/10.1016/j.sorms.2012.08.001openalex-snapshot
Non-convex mixed-integer nonlinear programming: A survey
inferred← citeshttps://doi.org/10.1016/j.sysconle.2018.09.002openalex-snapshot
A distributed continuous-time method for non-convex QCQPs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00266-9openalex-snapshot
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00352-3openalex-snapshot
Semidefinite programming for discrete optimization and matrix completion problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00102-xopenalex-snapshot
Semidefinite programming relaxations for the graph partitioning problem
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00097-xopenalex-snapshot
Semidefinite programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1021/acs.iecr.7b01270openalex-snapshot
Solving 0–1 Quadratic Programs by Reformulation Techniques
inferred← citeshttps://doi.org/10.1023/a:1008240227198openalex-snapshot
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems
inferred← citeshttps://doi.org/10.1023/a:1008282830093openalex-snapshot
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs
inferred← citeshttps://doi.org/10.1023/a:1008370723217openalex-snapshot
Approximating Global Quadratic Optimization with Convex Quadratic Constraints
inferred← citeshttps://doi.org/10.1023/a:1009739827008openalex-snapshot
Approximation Algorithms for Quadratic Programming
inferred← citeshttps://doi.org/10.1023/a:1009795911987openalex-snapshot
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1023/a:1011233805045openalex-snapshot
Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques
inferred← citeshttps://doi.org/10.1023/a:1019236832495openalex-snapshot
Decomposition and Linearization for 0-1 Quadratic Programming
inferred← citeshttps://doi.org/10.1023/b:numa.0000021765.17831.bcopenalex-snapshot
Using a Conic Formulation for Finding Steiner Minimal Trees
inferred← citeshttps://doi.org/10.1051/ro/2018034openalex-snapshot
A guide to conic optimisation and its applications
inferred← citeshttps://doi.org/10.1051/ro:2001120openalex-snapshot
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
inferred← citeshttps://doi.org/10.1051/ro:2003012openalex-snapshot
A Derivation of Lovász' Theta via Augmented Lagrange Duality
inferred← citeshttps://doi.org/10.1080/02331930108844555openalex-snapshot
A continuous approch for globally solving linearly constrained quadratic
inferred← citeshttps://doi.org/10.1080/10556780108805818openalex-snapshot
A projected gradient algorithm for solving the maxcut SDP relaxation
inferred← citeshttps://doi.org/10.1080/10556780108805819openalex-snapshot
Second order cone programming relaxation of nonconvex quadratic optimization problems
inferred← citeshttps://doi.org/10.1080/1055678021000090033openalex-snapshot
Randomized heuristics for the Max-Cut problem
inferred← citeshttps://doi.org/10.1080/10556789808805692openalex-snapshot
Copositive realxation for genera quadratic programming
inferred← citeshttps://doi.org/10.1080/10556789908805761openalex-snapshot
Mixed linear and semidefinite programming for combinatorial and quadratic optimization
inferred← citeshttps://doi.org/10.1109/acssc.2006.355134openalex-snapshot
High Diversity Detection Using Semidefinite Relaxation
inferred← citeshttps://doi.org/10.1109/cac51589.2020.9326828openalex-snapshot
A benchmark generator for boolean quadratic programming
inferred← citeshttps://doi.org/10.1109/cvpr.2007.383202openalex-snapshot
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
inferred← citeshttps://doi.org/10.1109/glocom.2007.803openalex-snapshot
A Low-Complexity Algorithm for Antenna Selection in Space-Time Block Coded Systems
inferred← citeshttps://doi.org/10.1109/icaci49185.2020.9177717openalex-snapshot
The Basic Algorithm for Zero-One Unconstrained Quadratic Programming Problem with k-diagonal Matrix
inferred← citeshttps://doi.org/10.1109/icassp.2013.6638263openalex-snapshot
Convex approximation of the NP-hard search problem in feature subset selection
inferred← citeshttps://doi.org/10.1109/iccv.2011.6126243openalex-snapshot
3D reconstruction of a smooth articulated trajectory from a monocular image sequence
inferred← citeshttps://doi.org/10.1109/spawc.2018.8445866openalex-snapshot
Random Access Schemes in Wireless Systems with Correlated User Activity
inferred← citeshttps://doi.org/10.1109/tit.2008.917634openalex-snapshot
The Diversity Order of the Semidefinite Relaxation Detector
inferred← citeshttps://doi.org/10.1109/tpami.2014.2372791openalex-snapshot
A Semidefinite Programming Based Search Strategy for Feature Selection with Mutual Information Measure
inferred← citeshttps://doi.org/10.1109/tsp.2005.861885openalex-snapshot
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations
inferred← citeshttps://doi.org/10.1109/tsp.2007.906697openalex-snapshot
Speeding up the Sphere Decoder With $H^{\infty }$ and SDP Inspired Lower Bounds
inferred← citeshttps://doi.org/10.1109/tsp.2007.908945openalex-snapshot
A Minimax Chebyshev Estimator for Bounded Error Estimation
inferred← citeshttps://doi.org/10.1109/tsp.2008.917856openalex-snapshot
Antenna Selection in Space-Time Block Coded Systems: Performance Analysis and Low-Complexity Algorithm
inferred← citeshttps://doi.org/10.1109/tsp.2010.2071866openalex-snapshot
On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms
inferred← citeshttps://doi.org/10.1109/tsp.2016.2563400openalex-snapshot
Discrete Sum Rate Maximization for MISO Interference Broadcast Channels: Convex Approximations and Efficient Algorithms
inferred← citeshttps://doi.org/10.1109/tsp.2020.3048232openalex-snapshot
Binary MIMO Detection via Homotopy Optimization and Its Deep Adaptation
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.1137/110826862openalex-snapshot
Second-Order-Cone Constraints for Extended Trust-Region Subproblems
inferred← citeshttps://doi.org/10.1137/120890636openalex-snapshot
A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
inferred← citeshttps://doi.org/10.1137/130929187openalex-snapshot
Ellipsoid Bounds for Convex Quadratic Integer Programming
inferred← citeshttps://doi.org/10.1137/140966332openalex-snapshot
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
inferred← citeshttps://doi.org/10.1137/140987997openalex-snapshot
Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
inferred← citeshttps://doi.org/10.1137/16m109778xopenalex-snapshot
Bounds for Random Binary Quadratic Programs
inferred← citeshttps://doi.org/10.1137/19m1249825openalex-snapshot
Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
inferred← citeshttps://doi.org/10.1137/s0895479898340299openalex-snapshot
On Lagrangian Relaxation of Quadratic Matrix Constraints
inferred← citeshttps://doi.org/10.1137/s1052623400379371openalex-snapshot
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
inferred← citeshttps://doi.org/10.1137/s1052623401394092openalex-snapshot
Computational Experience with Stable Set Relaxations
inferred← citeshttps://doi.org/10.1137/s1052623497328008openalex-snapshot
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/s1052623498336450openalex-snapshot
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
inferred← citeshttps://doi.org/10.1142/s0217595914500225openalex-snapshot
SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY
inferred← citeshttps://doi.org/10.1145/2897824.2925913openalex-snapshot
Point registration via efficient convex relaxation
inferred← citeshttps://doi.org/10.1287/ijoc.2014.0596openalex-snapshot
Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0719openalex-snapshot
Asymptotically Tight MILP Approximations for a Nonconvex QCP
inferred← citeshttps://doi.org/10.1287/moor.1100.0472openalex-snapshot
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
inferred← citeshttps://doi.org/10.1287/moor.2021.0338openalex-snapshot
Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1287/opre.2021.2241openalex-snapshot
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs
inferred← citeshttps://doi.org/10.1371/journal.pone.0281443openalex-snapshot
Subgroup fairness in two-sided markets
inferred← citeshttps://doi.org/10.1504/ijmor.2009.022879openalex-snapshot
Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
inferred← citeshttps://doi.org/10.15807/jorsj.46.164openalex-snapshot
A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
inferred← citeshttps://doi.org/10.17615/k256-xr13openalex-snapshot
Continuous Optimization Methods for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.18452/13962openalex-snapshot
Relaxation and decomposition methods for mixed integer nonlinear programming
inferred← citeshttps://doi.org/10.22331/q-2021-06-17-479openalex-snapshot
Warm-starting quantum optimization
inferred← citeshttps://doi.org/10.2298/fil1308511wopenalex-snapshot
A new convex relaxation for quadratically constrained quadratic programming
inferred← citeshttps://doi.org/10.3390/e21020108openalex-snapshot
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
inferred← citeshttps://doi.org/10.3390/math11214413openalex-snapshot
A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming
inferred← citeshttps://doi.org/10.3929/ethz-a-010492674openalex-snapshot
Towards Robust Audio-Visual Speech Recognition
inferred← citeshttps://doi.org/10.4208/jcm.1708-m2017-0130openalex-snapshot
On Doubly Positive Semidefinite Programming Relaxations
inferred← citeshttps://doi.org/10.4230/lipics.sea.2022.24openalex-snapshot
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5406openalex-snapshot
The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems
inferred← citeshttps://doi.org/10.48550/arxiv.1510.06421openalex-snapshot
Concave Quadratic Cuts for Mixed-Integer Quadratic Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1606.04232openalex-snapshot
DCNNs on a Diet: Sampling Strategies for Reducing the Training Set Size
inferred← citeshttps://doi.org/10.48550/arxiv.1802.00897openalex-snapshot
Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem
inferred← citeshttps://doi.org/10.48550/arxiv.2103.13493openalex-snapshot
Distributed Newton-like Algorithms and Learning for Optimized Power Dispatch
inferred← citeshttps://doi.org/10.52326/jes.utm.2022.29(4).05openalex-snapshot
SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX
inferred← citeshttps://doi.org/10.54337/aau478415180openalex-snapshot
Methods for Massive, Reliable, and Timely Access for Wireless Internet of Things (IoT)
inferred← citeshttps://doi.org/10.70675/70c980c7z4ba9z45aczb9a3z32084b1e1b04openalex-snapshot
Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C.
inferred← citeshttps://doi.org/10.70675/d1d92f8ez512ez45f0z8073z3915d3179618openalex-snapshot
Méthodes de points intérieurs et leurs applications sur des problèmes d'optimisation semi-définis
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.