Projected gradient methods for linearly constrained problems
From MaRDI portal
Publication:3773706
DOI10.1007/BF02592073zbMATH Open0634.90064OpenAlexW2098132613MaRDI QIDQ3773706FDOQ3773706
Authors: Paul H. Calamai, Jorge J. Moré 
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592073
Recommendations
- scientific article; zbMATH DE number 4025156
- scientific article; zbMATH DE number 4185389
- scientific article; zbMATH DE number 741123
- scientific article; zbMATH DE number 1150496
- Publication:4207528
- Projective method of multipliers for linearly constrained convex minimization
- A projected gradient method for vector optimization problems
- scientific article; zbMATH DE number 468924
- Combined projected gradient algorithm for linear programming
- scientific article; zbMATH DE number 3968343
bound constrained problemsconvergence theorygradient projection methodlarge scale problemslinearly constrained problems
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Cites Work
- The conjugate gradient method in extremal problems
- Title not available (Why is that?)
- Projection methods for variational inequalities with application to the traffic assignment problem
- Title not available (Why is that?)
- Convex programming in Hilbert space
- Two-Metric Projection Methods for Constrained Optimization
- On the Identification of Active Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Goldstein-Levitin-Polyak gradient projection method
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Projected Newton Methods for Optimization Problems with Simple Constraints
- The Gradient Projection Method under Mild Differentiability Conditions
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- The Gradient Projection Method Using Curry’s Steplength
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- On solutions of sparsity constrained optimization
- On solving simple bilevel programs with a nonconvex lower level program
- Finite convergence of the proximal point algorithm for variational inequality problems
- A cone constrained convex program: structure and algorithms
- A regularized gradient projection method for the minimization problem
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A robust sequential quadratic programming method
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Averaged mappings and the gradient-projection algorithm
- Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws
- A new approximation of the matrix rank function and its application to matrix rank minimization
- An active set limited memory BFGS algorithm for bound constrained optimization
- Z-eigenvalue methods for a global polynomial optimization problem
- Sparse classification: a scalable discrete optimization perspective
- The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- An active-set projected trust region algorithm for box constrained optimization problems
- Convergence properties of trust region methods for linear and convex constraints
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
- Strong convergence of a hybrid projection iterative algorithm for common solutions of operator equations and of inclusion problems
- Algorithms for bound constrained quadratic programming problems
- Minimum principle sufficiency
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- On the convergence of an active-set method for \(\ell_1\) minimization
- A class of iterative methods for solving nonlinear projection equations
- Strong convergence of a projected gradient method
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- A multivariate spectral projected gradient method for bound constrained optimization
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- Variant gradient projection methods for the minimization problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Modified extragradient methods for solving variational inequalities
- A superlinearly convergent projection method for constrained systems of nonlinear equations
- On the decrease of a quadratic function along the projected-gradient path
- Exposing Constraints
- A subspace modified PRP method for large-scale nonlinear box-constrained optimization
- Convergence of a projected gradient method variant for quasiconvex objectives
- Optimality, identifiability, and sensitivity
- Decomposition method for a class of monotone variational inequality problems
- Solution of projection problems over polytopes
- Local convergence analysis of projection-type algorithms: unified approach
- A projection method for a system of nonlinear monotone equations with convex constraints
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- A modified augmented Lagrangian method for a class of monotone variational inequalities
- An operator splitting algorithm for Tikhonov-regularized topology optimization
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Single-projection procedure for linear optimization
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Weak sharp solutions for generalized variational inequalities
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- Selected bibliography on degeneracy
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- Multicriteria approach to bilevel optimization
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- A projected gradient and constraint linearization method for nonlinear model predictive control
- On finite convergence and constraint identification of subgradient projection methods
- The Lagrangian globalization method for nonsmooth constrained equations
- Modified descent-projection method for solving variational inequalities
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities.
- Family of projected descent methods for optimization problems with simple bounds
- Approximation of zeros of inverse strongly monotone operators in Banach spaces
- Some recent advances in projection-type methods for variational inequalities
- An iterative working-set method for large-scale nonconvex quadratic programming
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Projection methods of iterative solutions in Hilbert spaces
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- Parameter selection and preconditioning for a graph form solver
- An active-set method for second-order conic-constrained quadratic programming
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Tangent projection equations and general variational inequalities
- On image reconstruction algorithms for binary electromagnetic geotomography
- Reconstruction algorithm for unknown cavities via Feynman-Kac type formula
- A quadratic penalty method for hypergraph matching
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- Title not available (Why is that?)
- Optimality conditions in variational form for non-linear constrained stochastic control problems
- New effective projection method for variational inequalities problem
- Implementing proximal point methods for linear programming
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- OPTIMAL TREATMENT PLANNING IN RADIOTHERAPY BASED ON BOLTZMANN TRANSPORT CALCULATIONS
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- Convergence properties of nonmonotone spectral projected gradient methods
- Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- Modified projection method for solving a system of monotone equations with convex constraints
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
- The gradient projection method with exact line search
This page was built for publication: Projected gradient methods for linearly constrained problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773706)
