Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
From MaRDI portal
Publication:4294750
DOI10.1137/0804009zbMath0801.65057OpenAlexW2042032299MaRDI QIDQ4294750
Publication date: 18 May 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0804009
Related Items (56)
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 solution of a two ball trust region subproblem ⋮ On box-constrained total least squares problem ⋮ An active-set algorithm for norm constrained quadratic problems ⋮ On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ A trust-region strategy for minimization on arbitrary domains ⋮ Computing the Signed Distance Between Overlapping Ellipsoids ⋮ Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée ⋮ Coderivatives of a Karush-Kuhn-Tucker point set map and applications ⋮ SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices ⋮ Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres ⋮ A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality ⋮ On KKT points of Celis-Dennis-Tapia subproblem ⋮ Quadratic programs with hollows ⋮ Double well potential function and its optimization in the \(N\)-dimensional real space. II ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ A computational study of global optimization solvers on two trust region subproblems ⋮ Variational inequalities over Euclidean balls ⋮ A survey of hidden convex optimization ⋮ A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints ⋮ Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem ⋮ On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ Solving trust region subproblems using Riemannian optimization ⋮ Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem ⋮ Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem ⋮ First-Order Methods for Nonconvex Quadratic Minimization ⋮ Linear Programming on the Stiefel Manifold ⋮ Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem ⋮ Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem ⋮ Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem ⋮ An alternating variable method for the maximal correlation problem ⋮ Behavior of DCA sequences for solving the trust-region subproblem ⋮ Globally solving extended trust region subproblems with two intersecting cuts ⋮ Local nonglobal minima for solving large-scale extended trust-region subproblems ⋮ A minimax method with application to the initial vector coding problem* ⋮ Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint ⋮ New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems ⋮ Copositivity for second-order optimality conditions in general smooth optimization problems ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems ⋮ A hybrid algorithm for the two-trust-region subproblem ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints ⋮ Quadratic optimization with two ball constraints ⋮ Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint ⋮ An Eigenvalue-Based Method for the Unbalanced Procrustes Problem ⋮ A Linear-Time Algorithm for Generalized Trust Region Subproblems ⋮ On local nonglobal minimum of trust-region subproblem and extension ⋮ Recent advances in trust region algorithms ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem ⋮ Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem ⋮ A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
This page was built for publication: Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
