Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres

DOI10.1016/S0167-6377(96)00036-3zbMath0876.90071OpenAlexW1993266907WikidataQ127186114 ScholiaQ127186114MaRDI QIDQ1362986

Tao Pham Dinh, Hoai An Le Thi

Publication date: 18 September 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00036-3

zbMATH Keywords

stabilityDCAdifference of convex functionsrobustnessefficiencynonconvex quadratic minimizationd.c. optimizationlocal and global optimality conditions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities, On global optimization with indefinite quadratics, Behavior of DCA sequences for solving the trust-region subproblem, The generalized trust region subproblem, Convergence analysis of difference-of-convex algorithm with subanalytic data, DC programming and DCA: thirty years of developments, Optimization-based stability analysis of structures under unilateral constraints, The trust region subproblem and semidefinite programming*, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, Numerical solution for optimization over the efficient set by d.c. optimization algorithms

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of a subgradient method for computing the bound norm of matrices
• A constrained eigenvalue problem
• Quadratically constrained least squares and quadratic problems
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• Computing a Trust Region Step
• Training multi-layered neural network with a trust-region based algorithm
• Computing Optimal Locally Constrained Steps
• Newton’s Method with a Model Trust Region Modification
• Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by trust-region optimization algorithm
• Monotone Operators and the Proximal Point Algorithm
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• Partial regularization of the sum of two maximal monotone operators
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Proximal Decomposition on the Graph of a Maximal Monotone Operator