On a solution method in indefinite quadratic programming under linear constraints
From MaRDI portal
Publication:6194122
DOI10.1080/02331934.2022.2141056OpenAlexW4308102342MaRDI QIDQ6194122
Yongdo Lim, Unnamed Author, Nguyen Dong Yen
Publication date: 19 March 2024
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2022.2141056
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence and stability of line search methods for unconstrained optimization
- Behavior of DCA sequences for solving the trust-region subproblem
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- Properties of two DC algorithms in quadratic programming
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Selected applications of all-quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- On affine scaling algorithms for nonconvex quadratic programming
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- On standard quadratic optimization problems
- A finite algorithm for solving general quadratic problems
- Optimization. Algorithms and consistent approximations
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- New error bounds and their applications to convergence analysis of iterative algorithms
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- DC programming and DCA: thirty years of developments
- Quadratic programming and affine variational inequalities. A qualitative study.
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- On linear convergence of iterative methods for the variational inequality problem
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Optimization Methods in Finance
- Applications of Quadratic Programming
- Asymptotic Analysis of Mixed Effects Models
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
This page was built for publication: On a solution method in indefinite quadratic programming under linear constraints
