Linear convergence of a type of iterative sequences in nonconvex quadratic programming
DOI10.1016/J.JMAA.2014.10.048zbMATH Open1310.90083OpenAlexW1990351344MaRDI QIDQ472338FDOQ472338
Authors: Hoang Ngoc Tuan 
Publication date: 19 November 2014
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2014.10.048
Recommendations
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Properties of two DC algorithms in quadratic programming
- On the convergence of Han's method for convex programming with quadratic objective
- A projection and contraction method for convex quadratic programming
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of applied optimization
- Nonlinear programming without a penalty function or a filter
- Quadratic programming and affine variational inequalities. A qualitative study.
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Behavior of DCA sequences for solving the trust-region subproblem
- Properties of two DC algorithms in quadratic programming
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- On the Barzilai and Borwein choice of steplength for the gradient method
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- On standard quadratic optimization problems
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- A finite algorithm for solving general quadratic problems
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
Cited In (8)
- On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions
- A DC programming approach to the continuous equilibrium network design problem
- Properties of two DC algorithms in quadratic programming
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- On the convergence of gradient projection methods for non-convex optimal control problems with affine system
- On a solution method in indefinite quadratic programming under linear constraints
- Local Error Bounds for Affine Variational Inequalities on Hilbert Spaces
- The boosted DC algorithm for linearly constrained DC programming
This page was built for publication: Linear convergence of a type of iterative sequences in nonconvex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472338)
