A Family of Supermemory Gradient Projection Methods for Constrained Optimization

DOI10.1080/0233193021000066464zbMath1145.90465MaRDI QIDQ4805781

Nai-Hua Xiu, Chang-Yu Wang, Y. J. Wang

Publication date: 8 May 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193021000066464

zbMATH Keywords

Projection; Stationary Point; Supermemory Gradient

Mathematics Subject Classification ID

90C25: Convex programming

90C52: Methods of reduced gradient type

Related Items

Modified projection method for solving a system of monotone equations with convex constraints, A projection method for a system of nonlinear monotone equations with convex constraints

Cites Work

• Unnamed Item
• Convergence properties of trust region methods for linear and convex constraints
• A class of superlinearly convergent projection algorithms with relaxed stepsizes
• On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
• Two-Metric Projection Methods for Constrained Optimization
• Projected gradient methods for linearly constrained problems
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Convex programming in Hilbert space
• Convergence properties of projection and contraction methods for variational inequality problems