scientific article

From MaRDI portal
Revision as of 14:24, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3802887

zbMath0655.90055MaRDI QIDQ3802887

Naum Z. Shor

Publication date: 1987


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (91)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approachesGlobally solving nonconvex quadratic programming problems with box constraints via integer programming methodsMaximal Quadratic-Free SetsLinear Programming Relaxations of Quadratically Constrained Quadratic ProgramsThe Boolean Quadric PolytopeConvex Relaxations for Permutation ProblemsA 2-person game on a polyhedral set of connected strategiesAn application-oriented approach to dual control with excitation for closed-loop identificationTowards breaking the exponential barrier for general secret sharingOptimal Information Blending with Measurements in the L2 SphereGenerating cutting planes for the semidefinite relaxation of quadratic programsA nonmonotone GRASPPhase retrieval for imaging problemsCertifying the global optimality of quartic minimization over the sphereA noncooperative game on polyhedral setsA tighter relaxation for the relative pose problem between camerasCutting Plane Generation through Sparse Principal Component AnalysisNew semidefinite programming relaxations for box constrained quadratic programInterplay of non-convex quadratically constrained problems with adjustable robust optimizationA spatial branch-and-cut method for nonconvex QCQP with bounded complex variablesOn N. Z. Shor's three scientific ideasThe equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables\texttt{EXPEDIS}: an exact penalty method over discrete setsA fresh CP look at mixed-binary QPs: new formulations and relaxationsEllipsoidal Relaxations of the Stable Set Problem: Theory and AlgorithmsSolution to global minimization of polynomials by backward differential flow\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variablesExact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programsA hierarchy of spectral relaxations for polynomial optimizationA branch and bound method solving the max–min linear discriminant analysis problemBinary Positive Semidefinite Matrices and Associated Integer PolytopesThe geometry of SDP-exactness in quadratic optimizationCvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondencesKKT-based primal-dual exactness conditions for the Shor relaxationConvex optimization approach to a single quadratically constrained quadratic minimization problemOptimization under uncertainty and risk: quadratic and copositive approachesConic optimization: a survey with special focus on copositive optimization and binary quadratic problemsOn Integrality in Semidefinite Programming for Discrete OptimizationOuter-product-free sets for polynomial optimization and oracle-based cutsProjectively and Weakly Simultaneously Diagonalizable Matrices and their ApplicationsInvariants of SDP exactness in quadratic programmingStrengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flowEnclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimizationA perfect example for the BFGS methodThe symmetric quadratic traveling salesman problemImproved estimation of duality gap in binary quadratic programming using a weighted distance measureUnbounded convex sets for non-convex mixed-integer quadratic programmingNonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representationsOn duality gap in binary quadratic programmingSemidefinite programming relaxations for the graph partitioning problemA compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programsOn global optimizations with polynomialsDual quadratic estimates in polynomial and Boolean programmingA distributed continuous-time method for non-convex QCQPsA guide to conic optimisation and its applicationsStable rank-one matrix completion is solved by the level \(2\) Lasserre relaxationSpectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic ProgramsExact relaxations of non-convex variational problemsA branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problemsOn improving convex quadratic programming relaxation for the quadratic assignment problemAn eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraintsThe MIN-cut and vertex separator problemEquivalences and differences in conic relaxations of combinatorial quadratic optimization problemsGlobal minimization of rational functions and the nearest GCDsFinding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex OptimizationRelaxing the optimality conditions of box QPSemidefinite programming for discrete optimization and matrix completion problemsParametric Lagrangian dual for the binary quadratic programming problemConic approximation to nonconvex quadratic programming with convex quadratic constraintsChebyshev center of the intersection of balls: complexity, relaxation and approximationSecond order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programmingSemidefinite relaxations for quadratically constrained quadratic programming: A review and comparisonsA survey on conic relaxations of optimal power flow problemExtended trust-region problems with one or two balls: exact copositive and Lagrangian relaxationsConvexity/Nonconvexity Certificates for Power Flow AnalysisA Two-Variable Approach to the Two-Trust-Region SubproblemPhase recovery, MaxCut and complex semidefinite programmingCheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extensionOn Conic Relaxations of Generalization of the Extended Trust Region SubproblemSolution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxationImmediate schedule adjustment and semidefinite relaxationAn alternative perspective on copositive and convex relaxations of nonconvex quadratic programsTrust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic OptimizationA Newton-bracketing method for a simple conic optimization problemCopositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization ProblemsSDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programsPolyhedra related to integer-convex polynomial systemsSemidefinite programmingStrengthened semidefinite relaxations via a second lifting for the Max-Cut problemMaximal quadratic-free setsS-lemma with equality and its applications







This page was built for publication: