Projected gradient methods for linearly constrained problems
From MaRDI portal
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
Cites work
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- Convex programming in Hilbert space
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- scientific article; zbMATH DE number 3934327 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Identification of Active Constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projection methods for variational inequalities with application to the traffic assignment problem
- The conjugate gradient method in extremal problems
- The Gradient Projection Method under Mild Differentiability Conditions
- The Gradient Projection Method Using Curry’s Steplength
- Two-Metric Projection Methods for Constrained Optimization
Cited in
(only showing first 100 items - show all)- A smoothing projected Newton-type algorithm for semi-infinite programming
- Z-eigenvalue methods for a global polynomial optimization problem
- Two error bounds for constrained optimization problems and their applications
- Modified extragradient methods for solving variational inequalities
- Algorithms for bound constrained quadratic programming problems
- Implementing proximal point methods for linear programming
- Solution of projection problems over polytopes
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Minimum principle sufficiency
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
- Selected bibliography on degeneracy
- On the convergence of the projected gradient method
- A class of iterative methods for solving nonlinear projection equations
- Family of projected descent methods for optimization problems with simple bounds
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems
- Weak sharp solutions for generalized variational inequalities
- Event-triggered identification of FIR systems with binary-valued output observations
- Error bounds and finite termination for constrained optimization problems
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
- On solving of constrained convex minimize problem using gradient projection method
- Information-based parameterization of the log-linear model for categorical data analysis
- A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- Solving variational inequality and fixed point problems by line searches and potential optimization
- The gradient projection method with exact line search
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A numerical algorithm for hydrodynamic free boundary problems
- On finite convergence and constraint identification of subgradient projection methods
- Local convergence analysis of projection-type algorithms: unified approach
- A robust sequential quadratic programming method
- An iterative working-set method for large-scale nonconvex quadratic programming
- Some recent advances in projection-type methods for variational inequalities
- A modified augmented Lagrangian method for a class of monotone variational inequalities
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- Decomposition method for a class of monotone variational inequality problems
- Identification of the blood perfusion rate for laser-induced thermotherapy in the liver
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- A node-to-node scheme for three-dimensional contact problems using the scaled boundary finite element method
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
- A sequential homotopy method for mathematical programming problems
- Attributed graph clustering with subspace stochastic block model
- A study on distributed optimization over large-scale networked systems
- A unified identification algorithm of FIR systems based on binary observations with time-varying thresholds
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- Distributed recursive projection identification with binary-valued observations
- Sparse classification: a scalable discrete optimization perspective
- Multilevel selective harmonic modulation via optimal control
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- On inexact projected gradient methods for solving variable vector optimization problems
- Payoff landscapes and the robustness of selfish optimization in iterated games
- General fixed-point method for solving the linear complementarity problem
- Proximal methods avoid active strict saddles of weakly convex functions
- LMBOPT: a limited memory method for bound-constrained optimization
- A novel projected gradient-like method for optimization problems with simple constraints
- An augmented Lagrangian filter method
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- Linear updates for a single-phase projective method
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration
- Stochastic structured tensors to stochastic complementarity problems
- Reconstruction algorithm for unknown cavities via Feynman-Kac type formula
- A projection descent method for solving variational inequalities
- A modified spectral conjugate gradient projection algorithm for total variation image restoration
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- An additional projection step to He and Liao's method for solving variational inequalities
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Modified descent-projection method for solving variational inequalities
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
- A self-adaptive projection method with improved step-size for solving variational inequalities
- Global convergence of a modified gradient projection method for convex constrained problems
- Minimization of convex functions on the convex hull of a point set
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- On solving simple bilevel programs with a nonconvex lower level program
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- A projection method for a system of nonlinear monotone equations with convex constraints
- The Lagrangian globalization method for nonsmooth constrained equations
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- On solutions of sparsity constrained optimization
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense
- Identification of ARMA models with binary-valued observations
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- An overview on projection-type methods for convex large-scale quadratic programs
- Generic minimizing behavior in semialgebraic optimization
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
- An orthogonal subspace minimization method for finding multiple solutions to the defocusing nonlinear Schrödinger equation with symmetry
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- On the convergence of an active-set method for _1 minimization
- On a new numerical method for solving general variational inequalities
- Projected gradient method for non-negative least square
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
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)
