Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
DOI10.1016/S0167-6377(96)00036-3zbMATH Open0876.90071OpenAlexW1993266907WikidataQ127186114 ScholiaQ127186114MaRDI QIDQ1362986FDOQ1362986
Authors: Pham Dinh Tao, Le Thi Hoai An 
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
Recommendations
- A DCA-Newton method for quartic minimization over the sphere
- Difference of convex solution of quadratically constrained optimization problems.
- scientific article; zbMATH DE number 823384
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
efficiencyrobustnessstabilityDCAdifference of convex functionsnonconvex quadratic minimizationd.c. optimizationlocal and global optimality conditions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A constrained eigenvalue problem
- Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by trust-region optimization algorithm
- Computing Optimal Locally Constrained Steps
- Computing a Trust Region Step
- Convergence of a subgradient method for computing the bound norm of matrices
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Monotone Operators and the Proximal Point Algorithm
- Newton’s Method with a Model Trust Region Modification
- Partial regularization of the sum of two maximal monotone operators
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Quadratically constrained least squares and quadratic problems
- Training multi-layered neural network with a trust-region based algorithm
Cited In (14)
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- On Algorithms for Difference of Monotone Operators
- The generalized trust region subproblem
- DC programming and DCA: thirty years of developments
- A DCA-Newton method for quartic minimization over the sphere
- Title not available (Why is that?)
- On algorithms for difference of monotone operators
- Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
- Behavior of DCA sequences for solving the trust-region subproblem
- On global optimization with indefinite quadratics
- The trust region subproblem and semidefinite programming*
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere
- Optimization-based stability analysis of structures under unilateral constraints
Uses Software
This page was built for publication: Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362986)
