Projected gradient methods for linearly constrained problems
From MaRDI portal
Publication:3773706
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
- 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?)
- 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
- 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 Gradient Projection Method Using Curry’s Steplength
- The Gradient Projection Method under Mild Differentiability Conditions
- The conjugate gradient method in extremal problems
- Two-Metric Projection Methods for Constrained Optimization
Cited in
(only showing first 100 items - show all)- An active-set method for second-order conic-constrained quadratic programming
- On image reconstruction algorithms for binary electromagnetic geotomography
- scientific article; zbMATH DE number 3989110 (Why is no real title available?)
- 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 node-to-node scheme for three-dimensional contact problems using the scaled boundary finite element method
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Asymptotic consensus of multi-agent systems under binary-valued observations and observation uncertainty
- Threshold selection and resource allocation for quantized identification
- Tangent projection equations and general variational inequalities
- Sensitivity of inverse advection-diffusion-reaction to sensor and control: a low computational cost tool
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- Global convergence of a modified gradient projection method for convex constrained problems
- A quadratic penalty method for hypergraph matching
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
- Reconstruction algorithm for unknown cavities via Feynman-Kac type formula
- On solutions of sparsity constrained optimization
- A projection descent method for solving variational inequalities
- Finite convergence of the proximal point algorithm for variational inequality problems
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- Optimality conditions in variational form for non-linear constrained stochastic control problems
- An augmented Lagrangian filter method
- On solving simple bilevel programs with a nonconvex lower level program
- A unified identification algorithm of FIR systems based on binary observations with time-varying thresholds
- 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
- A cone constrained convex program: structure and algorithms
- scientific article; zbMATH DE number 4025156 (Why is no real title available?)
- On solving of constrained convex minimize problem using gradient projection method
- A regularized gradient projection method for the minimization problem
- An orthogonal subspace minimization method for finding multiple solutions to the defocusing nonlinear Schrödinger equation with symmetry
- Quickly Finding the Best Linear Model in High Dimensions via Projected Gradient Descent
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- General fixed-point method for solving the linear complementarity problem
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- Implementing proximal point methods for linear programming
- A posteriori error control for the binary Mumford-Shah model
- A robust sequential quadratic programming method
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- New effective projection method for variational inequalities problem
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Averaged mappings and the gradient-projection algorithm
- Information-based parameterization of the log-linear model for categorical data analysis
- Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
- Asymptotically efficient quasi-Newton type identification with quantized observations under bounded persistent excitations
- Sparse recovery under nonnegativity and sum-to-one constraints
- A new approximation of the matrix rank function and its application to matrix rank minimization
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- OPTIMAL TREATMENT PLANNING IN RADIOTHERAPY BASED ON BOLTZMANN TRANSPORT CALCULATIONS
- Convergence properties of nonmonotone spectral projected gradient methods
- On the rate of convergence of projected Barzilai-Borwein methods
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- An active set limited memory BFGS algorithm for bound constrained optimization
- A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties
- Z-eigenvalue methods for a global polynomial optimization problem
- Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- Adaptive tracking control under quantized observations and observation uncertainty with unbounded variance
- Modified projection method for solving a system of monotone equations with convex constraints
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- Sparse classification: a scalable discrete optimization perspective
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- A gradient descent method for estimating the Markov chain choice model
- The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
- An active-set projected trust region algorithm for box constrained optimization problems
- An overview on projection-type methods for convex large-scale quadratic programs
- Convergence properties of trust region methods for linear and convex constraints
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
- 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 inexact projected gradient methods for solving variable vector optimization problems
- A sequential homotopy method for mathematical programming problems
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- An MCMC method for uncertainty quantification in nonnegativity constrained inverse problems
- The gradient projection method with exact line search
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- On the convergence of an active-set method for \(\ell_1\) minimization
- Strong convergence of a projected gradient method
- A class of iterative methods for solving nonlinear projection equations
- A study on distributed optimization over large-scale networked systems
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A multivariate spectral projected gradient method for bound constrained optimization
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- Payoff landscapes and the robustness of selfish optimization in iterated games
- Proximal methods avoid active strict saddles of weakly convex functions
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
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)
