A Family of Supermemory Gradient Projection Methods for Constrained Optimization

DOI10.1080/0233193021000066464MaRDI QIDQ4805781zbMATH OpenOpenAlexFDO

Authors Yiju Wang, Changyu Wang, Naihua Xiu

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

ProjectionStationary PointSupermemory Gradient

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Recommendations

• A supermemory gradient projection algorithm for optimization problems with nonlinear constraints
• A new supermemory gradient method for unconstrained optimization problems
• A supermemory gradient method for unconstrained optimization
• Supermemory gradient methods for monotone nonlinear equations with convex constraints
• A nonmonotone supermemory gradient algorithm for unconstrained optimization
• A new class of supermemory gradient methods
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
• A supermemory gradient method based on the nonmonotone technique
• Publication:4887667
• scientific article; zbMATH DE number 2150661

Cites work

• scientific article; zbMATH DE number 3414220 (Why is no real title available?)
• A class of superlinearly convergent projection algorithms with relaxed stepsizes
• An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
• Convergence properties of projection and contraction methods for variational inequality problems
• Convergence properties of trust region methods for linear and convex constraints
• Convex programming in Hilbert space
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Projected gradient methods for linearly constrained problems
• Two-Metric Projection Methods for Constrained Optimization

Cited in

(9)

• Global convergence of a modified gradient projection method for convex constrained problems
• Modified projection method for solving a system of monotone equations with convex constraints
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
• A projection method for a system of nonlinear monotone equations with convex constraints
• Constructing memory-minimizing schedules for multifrontal methods
• scientific article; zbMATH DE number 1135750 (Why is no real title available?)
• A novel method of dynamic force identification and its application
• A supermemory gradient projection algorithm for optimization problems with nonlinear constraints
• A novel fractional Tikhonov regularization coupled with an improved super-memory gradient method and application to dynamic force identification problems

This page was built for publication: A Family of Supermemory Gradient Projection Methods for Constrained Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805781)