Polynomial Solvability of Variants of the Trust-Region Subproblem

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

Publication:5383987

DOI10.1137/1.9781611973402.28zbMath1428.90109OpenAlexW4254731324MaRDI QIDQ5383987

Bienstock, Daniel, Alexander Michalka

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.28




Related Items (20)

On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two ConstraintsOn box-constrained total least squares problemOn Convex Hulls of Epigraphs of QCQPsOn the tightness of SDP relaxations of QCQPsRefined bounds on the convergence of block Lanczos method for extended trust-region subproblemA survey of hidden convex optimizationExact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programsOn the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblemKKT-based primal-dual exactness conditions for the Shor relaxation(Global) optimization: historical notes and recent developmentsFinding second-order stationary points in constrained minimization: a feasible direction approachAggregations of Quadratic Inequalities and Hidden Hyperplane ConvexityClosing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region SubproblemThe Convex Hull of a Quadratic Constraint over a PolytopeA Block Lanczos Method for the Extended Trust-Region SubproblemA Trust-Region Algorithm for Heterogeneous Multiobjective OptimizationChebyshev center of the intersection of balls: complexity, relaxation and approximationSome results for quadratic problems with one or two quadratic constraintsAn SOCP relaxation based branch-and-bound method for generalized trust-region subproblemCheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension







This page was built for publication: Polynomial Solvability of Variants of the Trust-Region Subproblem