Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
From MaRDI portal
(Redirected from Publication:1362986)
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
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3650320 (Why is no real title available?)
- scientific article; zbMATH DE number 3871040 (Why is no real title available?)
- scientific article; zbMATH DE number 4032473 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 590298 (Why is no real title available?)
- scientific article; zbMATH DE number 823384 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- 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
(15)- Convergence analysis of difference-of-convex algorithm with subanalytic data
- The generalized trust region subproblem
- On Algorithms for Difference of Monotone Operators
- DC programming and DCA: thirty years of developments
- A DCA-Newton method for quartic minimization over the sphere
- Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
- scientific article; zbMATH DE number 823384 (Why is no real title available?)
- On algorithms for difference of monotone operators
- 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
- Computing proximity operators of scale and signed permutation invariant functions
- Optimization-based stability analysis of structures under unilateral constraints
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)
