Behavior of DCA sequences for solving the trust-region subproblem
From MaRDI portal
Publication:454269
DOI10.1007/s10898-011-9696-zzbMath1259.65092MaRDI QIDQ454269
Tao Pham Dinh, Nguyen Dong Yen, Hoai An Le Thi
Publication date: 1 October 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9696-z
numerical examples; trust-region subproblem; DCA sequence; difference-of-convex-functions algorithms; Karsh-Kuhn-Tucker point set; limiting behavior and stability; multiplicity of nonpositive eigenvalue
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C51: Interior-point methods
Related Items
Coderivatives of implicit multifunctions and stability of variational systems, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, Convergence analysis of difference-of-convex algorithm with subanalytic data, DC programming and DCA: thirty years of developments, Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem, Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem, Boundedness of a type of iterative sequences in two-dimensional quadratic programming, Coderivatives of a Karush-Kuhn-Tucker point set map and applications, The boosted DC algorithm for linearly constrained DC programming, DC Programming and DCA for General DC Programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- Minimizing a Quadratic Over a Sphere
- Generation of large-scale quadratic programs for use as global optimization test problems
- Computing Optimal Locally Constrained Steps
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- Stability of Linear-Quadratic Minimization over Euclidean Balls
- Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem
