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)
- 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
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems
- A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Generic minimizing behavior in semialgebraic optimization
- An additional projection step to He and Liao's method for solving variational inequalities
- Identification of the blood perfusion rate for laser-induced thermotherapy in the liver
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
- Two error bounds for constrained optimization problems and their applications
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Solving emission tomography problems on vector machines
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- A self-adaptive projection method with improved step-size for solving variational inequalities
- Large‐margin classification with multiple decision rules
- New step lengths in projection method for variational inequality problems
- Minimization of convex functions on the convex hull of a point set
- Solving variational inequality and fixed point problems by line searches and potential optimization
- LMBOPT: a limited memory method for bound-constrained optimization
- Error bounds and finite termination for constrained optimization problems
- An improved generalized flexibility matrix approach for structural damage detection
- An Eulerian-Lagrangian method for optimization problems governed by multidimensional nonlinear hyperbolic PDEs
- Title not available (Why is that?)
- Stopping rules and backward error analysis for bound-constrained optimization
- Impulse noise removal by an adaptive trust-region method
- Lower bounds for ground states of condensed matter systems
- Convergence properties of inexact projected gradient methods
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- A numerical algorithm for hydrodynamic free boundary problems
- Energy efficiency optimization algorithm of CR-NOMA system based on SWIPT
- An algorithm for local continuous optimization of traffic signals
- Ergodic convergence in subgradient optimization
- A projection-filter method for solving nonlinear complementarity problems
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- On a new numerical method for solving general variational inequalities
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
- Cross-Hill: a heuristic method for global optimization
- Global convergence and finite termination of a class of smooth penalty function algorithms
- A projected gradient trust-region method for solving nonlinear systems with convex constraints
- Title not available (Why is that?)
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- 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
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)
