Semidefinite relaxation and nonconvex quadratic optimization
From MaRDI portal
Publication:4391292
DOI10.1080/10556789808805690zbMath0904.90136OpenAlexW2045148236MaRDI QIDQ4391292
No author found.
Publication date: 2 June 1998
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805690
Related Items
Robust sub-Gaussian estimation of a mean vector in nearly linear time, A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints, Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms, Improved approximations for max set splitting and max NAE SAT, Approximation algorithm for MAX DICUT with given sizes of parts, On box-constrained total least squares problem, Grothendieck-Type Inequalities in Combinatorial Optimization, A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems, Fast Heuristics and Approximation Algorithms, Using the eigenvalue relaxation for binary least-squares estimation problems, A note on approximating quadratic programming with rank constraint, Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading, Certifying the global optimality of quartic minimization over the sphere, Optimization and operations research in mitigation of a pandemic, Approximating the little Grothendieck problem over the orthogonal and unitary groups, New semidefinite programming relaxations for box constrained quadratic program, Input design for discrimination between classes of LTI models, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Approximation algorithms for discrete polynomial optimization, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, Global optimization of bilinear programs with a multiparametric disaggregation technique, Trigonometric approximation of the max-cut polytope is star-like, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, Computation of the phase and gain margins of MIMO control systems, Approximation algorithm for a class of global optimization problems, Tight computationally efficient approximation of matrix norms with applications, Approximation algorithms for indefinite complex quadratic maximization problems, Mean estimation with sub-Gaussian rates in polynomial time, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, Phase transitions in semidefinite relaxations, Effective algorithms for optimal portfolio deleveraging problem with cross impact, An approximation algorithm for scheduling two parallel machines with capacity constraints., Barrier subgradient method, Linear programing relaxations for a strategic pricing problem in electricity markets, A generalized Grothendieck inequality and nonlocal correlations that require high entanglement, Improved estimation of duality gap in binary quadratic programming using a weighted distance measure, Hidden conic quadratic representation of some nonconvex quadratic optimization problems, Two proposals for robust PCA using semidefinite programming, Radar waveform design for extended target recognition under detection constraints, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, A \({\mathsf{D}}\)-induced duality and its applications, Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions, Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, The complexity of optimizing over a simplex, hypercube or sphere: a short survey, Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint, Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization, Memory-Efficient Structured Convex Optimization via Extreme Point Sampling, Simplicial faces of the set of correlation matrices, Approximating the 2-catalog segmentation problem using semidefinite programming relaxations, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, LMI approximations for the radius of the intersection of ellipsoids: Survey., Semi-definite relaxation algorithm of multiple knapsack problem, A projected gradient algorithm for solving the maxcut SDP relaxation, Second order cone programming relaxation of nonconvex quadratic optimization problems, Optimization-based stability analysis of structures under unilateral constraints, On the gap between the quadratic integer programming problem and its semidefinite relaxation, Approximation algorithms for MAX RES CUT with limited unbalanced constraints, Parametric Lagrangian dual for the binary quadratic programming problem, An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance, Penalized semidefinite programming for quadratically-constrained quadratic optimization, A MAX-CUT formulation of 0/1 programs, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Elementary Optimality Conditions for Nonlinear SDPs, Phase recovery, MaxCut and complex semidefinite programming, Complexity and algorithms for finding a subset of vectors with the longest sum, Community detection in sparse networks via Grothendieck's inequality, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, Approximability of the Problem of Finding a Vector Subset with the Longest Sum, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Approximate Kernel Clustering, Interval solutions for interval algebraic equations, Role of redundant constraints for improving dual bounds in polynomial optimization problems, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, Probability Bounds for Polynomial Functions in Random Variables, Non-unique games over compact groups and orientation estimation in cryo-EM, Global Registration of Multiple Point Clouds Using Semidefinite Programming, On approximation of max-vertex-cover, Statistical quality assessment of Ising-based annealer outputs, Generalised polynomial chaos expansion approaches to approximate stochastic model predictive control†, On the Slater condition for the SDP relaxations of nonconvex sets, Control analysis and design via randomised coordinate polynomial minimisation, A semi-definite programming approach for robust tracking
Cites Work
