New Results on Quadratic Minimization
From MaRDI portal
Publication:4441956
DOI10.1137/S105262340139001XzbMath1043.90064OpenAlexW2074859470MaRDI QIDQ4441956
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s105262340139001x
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (98)
An efficient algorithm for the extended trust-region subproblem with two linear constraints ⋮ On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ On the complexity of quadratic programming with two quadratic constraints ⋮ On box-constrained total least squares problem ⋮ On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts ⋮ A linear-time algorithm for trust region problems ⋮ A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming ⋮ On the local stability of semidefinite relaxations ⋮ Exactness conditions for an SDP relaxation of the extended trust region problem ⋮ SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices ⋮ Convex sets with semidefinite representation ⋮ Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ 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 ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Quadratic programs with hollows ⋮ Distributionally robust profit opportunities ⋮ A survey of hidden convex optimization ⋮ Exact computable representation of some second-order cone constrained quadratic programming problems ⋮ A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints ⋮ Indefinite least squares with a quadratic constraint ⋮ On the quadratic fractional optimization with a strictly convex quadratic constraint ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs ⋮ Quaternion matrix decomposition and its theoretical implications ⋮ Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems ⋮ A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints ⋮ On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ KKT-based primal-dual exactness conditions for the Shor relaxation ⋮ (Global) optimization: historical notes and recent developments ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ Cardinality constrained portfolio selection problem: a completely positive programming approach ⋮ Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty ⋮ Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem ⋮ Linear pencils and quadratic programming problems with a quadratic constraint ⋮ Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem ⋮ Hidden conic quadratic representation of some nonconvex quadratic optimization problems ⋮ Non-quadratic extension of homogeneous S-lemma and its applications in optimization ⋮ Quadratic optimization over one first-order cone ⋮ 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 ⋮ The generalized trust region subproblem ⋮ A Block Lanczos Method for the Extended Trust-Region Subproblem ⋮ Globally solving extended trust region subproblems with two intersecting cuts ⋮ Quadratic optimization over a second-order cone with linear equality constraints ⋮ Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint ⋮ Strong duality for generalized trust region subproblem: S-lemma with interval bounds ⋮ Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices ⋮ 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 ⋮ Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints ⋮ An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation ⋮ Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint ⋮ Adaptive computable approximation to cones of nonnegative quadratic functions ⋮ New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem ⋮ Theorems of the alternative for inequality systems of real polynomials ⋮ New results on Hermitian matrix rank-one decomposition ⋮ Conic approximation to nonconvex quadratic programming with convex quadratic constraints ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ A Note on Polynomial Solvability of the CDT Problem ⋮ 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 Two-Variable Approach to the Two-Trust-Region Subproblem ⋮ On the global optimality of generalized trust region subproblems ⋮ A new conic approach to semisupervised support vector machines ⋮ Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming ⋮ The trust region subproblem with non-intersecting linear constraints ⋮ Quadratic optimization over a polyhedral cone ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ Global optimality condition for quadratic optimization problems under data uncertainty ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem ⋮ An SDP approach for quadratic fractional problems with a two-sided quadratic constraint ⋮ A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere ⋮ Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming ⋮ A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint ⋮ A hybrid algorithm for the two-trust-region subproblem ⋮ On the convexity for the range set of two quadratic functions ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints ⋮ Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint ⋮ A Linear-Time Algorithm for Generalized Trust Region Subproblems ⋮ Global optimality conditions for nonlinear programming problems with linear equality constraints ⋮ An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic 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 ⋮ S-lemma with equality and its applications
This page was built for publication: New Results on Quadratic Minimization
