scientific article
From MaRDI portal
Publication:3802887
zbMath0655.90055MaRDI QIDQ3802887
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20)
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Maximal Quadratic-Free Sets, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, The Boolean Quadric Polytope, Convex Relaxations for Permutation Problems, A 2-person game on a polyhedral set of connected strategies, An application-oriented approach to dual control with excitation for closed-loop identification, Towards breaking the exponential barrier for general secret sharing, Optimal Information Blending with Measurements in the L2 Sphere, Generating cutting planes for the semidefinite relaxation of quadratic programs, A nonmonotone GRASP, Phase retrieval for imaging problems, Certifying the global optimality of quartic minimization over the sphere, A noncooperative game on polyhedral sets, A tighter relaxation for the relative pose problem between cameras, Cutting Plane Generation through Sparse Principal Component Analysis, New semidefinite programming relaxations for box constrained quadratic program, Interplay of non-convex quadratically constrained problems with adjustable robust optimization, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, On N. Z. Shor's three scientific ideas, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, \texttt{EXPEDIS}: an exact penalty method over discrete sets, A fresh CP look at mixed-binary QPs: new formulations and relaxations, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, Solution to global minimization of polynomials by backward differential flow, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, A hierarchy of spectral relaxations for polynomial optimization, A branch and bound method solving the max–min linear discriminant analysis problem, Binary Positive Semidefinite Matrices and Associated Integer Polytopes, The geometry of SDP-exactness in quadratic optimization, CvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondences, KKT-based primal-dual exactness conditions for the Shor relaxation, Convex optimization approach to a single quadratically constrained quadratic minimization problem, Optimization under uncertainty and risk: quadratic and copositive approaches, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, On Integrality in Semidefinite Programming for Discrete Optimization, Outer-product-free sets for polynomial optimization and oracle-based cuts, Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications, Invariants of SDP exactness in quadratic programming, Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, A perfect example for the BFGS method, The symmetric quadratic traveling salesman problem, Improved estimation of duality gap in binary quadratic programming using a weighted distance measure, Unbounded convex sets for non-convex mixed-integer quadratic programming, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, On duality gap in binary quadratic programming, Semidefinite programming relaxations for the graph partitioning problem, A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs, On global optimizations with polynomials, Dual quadratic estimates in polynomial and Boolean programming, A distributed continuous-time method for non-convex QCQPs, A guide to conic optimisation and its applications, Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Exact relaxations of non-convex variational problems, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, On improving convex quadratic programming relaxation for the quadratic assignment problem, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, The MIN-cut and vertex separator problem, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Global minimization of rational functions and the nearest GCDs, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Relaxing the optimality conditions of box QP, Semidefinite programming for discrete optimization and matrix completion problems, Parametric Lagrangian dual for the binary quadratic programming problem, Conic approximation to nonconvex quadratic programming with convex quadratic constraints, Chebyshev center of the intersection of balls: complexity, relaxation and approximation, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, A survey on conic relaxations of optimal power flow problem, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Convexity/Nonconvexity Certificates for Power Flow Analysis, A Two-Variable Approach to the Two-Trust-Region Subproblem, Phase recovery, MaxCut and complex semidefinite programming, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, On Conic Relaxations of Generalization of the Extended Trust Region Subproblem, Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation, Immediate schedule adjustment and semidefinite relaxation, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization, A Newton-bracketing method for a simple conic optimization problem, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Polyhedra related to integer-convex polynomial systems, Semidefinite programming, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, Maximal quadratic-free sets, S-lemma with equality and its applications
