A super-linear convergent gradient projection type algorithm for linearly constrained problems
From MaRDI portal
Publication:761975
DOI10.1016/0377-2217(84)90288-1zbMath0557.90076MaRDI QIDQ761975
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90288-1
linear constraints; superlinear convergence; variable metric method; gradient projection; convex objective functions
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C55: Methods of successive quadratic programming type
Related Items
A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy, A new generalized gradient projection type algorithm for linearly constrained problems, A class of trust region methods for linear inequality constrained optimization and its theory analysis. I: Algorithm and global convergence, A class of trust region methods for linear inequality constrained optimization and its theory analysis. II: Local convergence rate and numerical tests, A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point