New Results on Quadratic Minimization
From MaRDI portal
Publication:4441956
DOI10.1137/S105262340139001XzbMath1043.90064MaRDI QIDQ4441956
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
90C22: Semidefinite programming
90C26: Nonconvex programming, global optimization
90C20: Quadratic programming
Related Items
A Block Lanczos Method for the Extended Trust-Region Subproblem, Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint, Unnamed Item, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint, Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem, Adaptive computable approximation to cones of nonnegative quadratic functions, On Chebyshev Center of the Intersection of Two Ellipsoids, A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere, Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint, A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants, New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, A Linear-Time Algorithm for Generalized Trust Region Subproblems, An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints, S-lemma with equality and its applications, A linear-time algorithm for trust region problems, Exactness conditions for an SDP relaxation of the extended trust region problem, Exact computable representation of some second-order cone constrained quadratic programming problems, On zero duality gap in nonconvex quadratic programming problems, The generalized trust region subproblem, Quadratic optimization over a second-order cone with linear equality constraints, Strong duality for generalized trust region subproblem: S-lemma with interval bounds, New results on Hermitian matrix rank-one decomposition, Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Moment inequalities for sums of random matrices and their applications in optimization, Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint, Tilt stability for quadratic programs with one or two quadratic inequality constraints, On box-constrained total least squares problem, Cardinality constrained portfolio selection problem: a completely positive programming approach, On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls, A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid, Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming, SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, An efficient algorithm for solving the generalized trust region subproblem, Quadratic programs with hollows, A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Theorems of the alternative for inequality systems of real polynomials, Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, Some results for quadratic problems with one or two quadratic constraints, On solving quadratically constrained quadratic programming problem with one non-convex constraint, A new conic approach to semisupervised support vector machines, Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty, An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients, Conic approximation to nonconvex quadratic programming with convex quadratic constraints, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, Global optimality condition for quadratic optimization problems under data uncertainty, On the convexity for the range set of two quadratic functions, A survey of hidden convex optimization, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, Globally solving extended trust region subproblems with two intersecting cuts, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint, A hybrid algorithm for the two-trust-region subproblem, Global optimality conditions for nonlinear programming problems with linear equality constraints, A gentle, geometric introduction to copositive optimization, Narrowing the difficulty gap for the Celis-Dennis-Tapia problem, Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme, On the complexity of quadratic programming with two quadratic constraints, Convex sets with semidefinite representation, Generalized S-lemma and strong duality in nonconvex quadratic programming, Hidden conic quadratic representation of some nonconvex quadratic optimization problems, Quadratic optimization over one first-order cone, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, The trust region subproblem with non-intersecting linear constraints, Quadratic optimization over a polyhedral cone, A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Distributionally robust profit opportunities, A Note on Polynomial Solvability of the CDT Problem, A Two-Variable Approach to the Two-Trust-Region Subproblem, An SDP approach for quadratic fractional problems with a two-sided quadratic constraint, On the quadratic fractional optimization with a strictly convex quadratic constraint, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, On the global optimality of generalized trust region subproblems
