Linear convergence of a type of iterative sequences in nonconvex quadratic programming

DOI10.1016/j.jmaa.2014.10.048zbMath1310.90083OpenAlexW1990351344MaRDI QIDQ472338

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

zbMATH Keywords

quadratic programmingconvergence rateDCA sequenceDC algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

The boosted DC algorithm for linearly constrained DC programming, On the convergence of gradient projection methods for non-convex optimal control problems with affine system, A DC Programming Approach to the Continuous Equilibrium Network Design Problem, Local Error Bounds for Affine Variational Inequalities on Hilbert Spaces, On a solution method in indefinite quadratic programming under linear constraints, On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Behavior of DCA sequences for solving the trust-region subproblem
• Properties of two DC algorithms in quadratic programming
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Nonlinear programming without a penalty function or a filter
• 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
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Quadratic programming and affine variational inequalities. A qualitative study.
• 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
• Two-Point Step Size Gradient Methods
• 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
• On the Barzilai and Borwein choice of steplength for the gradient method
• Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming