On the Goldstein-Levitin-Polyak gradient projection method
From MaRDI portal
Publication:4090967
DOI10.1109/TAC.1976.1101194zbMATH Open0326.49025MaRDI QIDQ4090967FDOQ4090967
Publication date: 1976
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Cited In (only showing first 100 items - show all)
- On image reconstruction algorithms for binary electromagnetic geotomography
- Cooperative adaptive sampling of random fields with partially known covariance
- Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model.
- Iterative learning control for constrained linear systems
- Convex constrained optimization for large-scale generalized Sylvester equations
- A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- A unified description of iterative algorithms for traffic equilibria
- A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities
- On iterative algorithms for linear least squares problems with bound constraints
- Face recognition from caption-based supervision
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Strong convergence of projected reflected gradient methods for variational inequalities
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Restricted simplicial decomposition for convex constrained problems
- Convex quadratic programming with one constraint and bounded variables
- Using Nesterov's method to accelerate multibody dynamics with friction and contact
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- Non-monotone projection gradient method for non-negative matrix factorization
- Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- A PDE-constrained optimization approach for topology optimization of strained photonic devices
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Efficient reliable image reconstruction schemes for diffuse optical tomography
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Novel Algorithm for Non-Negative Matrix Factorization
- Algorithms for bound constrained quadratic programming problems
- On the interplay between acceleration and identification for the proximal gradient algorithm
- Smooth sparse coding via marginal regression for learning sparse representations
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Optimal control of the temperature in a catalytic converter
- 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
- Convergence of a projected gradient method variant for quasiconvex objectives
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Solution of projection problems over polytopes
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Perron vector optimization applied to search engines
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Computational enhancements to fluence map optimization for total marrow irradiation using IMRT
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Discrete tomography by convex--concave regularization and D.C. programming
- Convergence analysis for the modified spectral projected subgradient method
- Shape optimization by free-form deformation: existence results and numerical solution for Stokes flows
- New step lengths in projection method for variational inequality problems
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- A conjugate gradient projection algorithm for the traffic assignment problem
- Optimal objective function approximation for separable convex quadratic programming
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
- Synchronisation and control of proliferation in cycling cell population models with age structure
- Bounded perturbation resilience of projected scaled gradient methods
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Projected gradient methods for linearly constrained problems
- On finite convergence and constraint identification of subgradient projection methods
- Ergodic convergence in subgradient optimization
- On the convergence of projected gradient processes to singular critical points
- Computational aspects of two-segment separable programming
- A feasible direction algorithm for convex optimization: Global convergence rates
- Non-expected route choice model under risk on stochastic traffic networks
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Family of projected descent methods for optimization problems with simple bounds
- Sample size selection in optimization methods for machine learning
- Numerical approach to monotone variational inequalities by a one-step projected reflected gradient method with line-search procedure
- Adaptive Relevance Matrices in Learning Vector Quantization
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- The effect of perturbations on the convergence rates of optimization algorithms
- Convergence of one-step projected gradient methods for variational inequalities
- Computing the generalized eigenvalues of weakly symmetric tensors
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
- Lasso estimation of hierarchical interactions for analyzing heterogeneity of treatment effect
- An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems
- Global convergence of a modified gradient projection method for convex constrained problems
- Single stage prediction with embedded topic modeling of online reviews for mobile app management
- Optimal Control of the Landau–de Gennes Model of Nematic Liquid Crystals
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Proximal Gradient Methods with Adaptive Subspace Sampling
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Efficient projected gradient methods for cardinality constrained optimization
- A cyclic projected gradient method
- Pareto-optimal sustainable transportation network design under spatial queuing
- Machine learning based iterative learning control for non‐repetitive time‐varying systems
- Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- A gradient descent method for estimating the Markov chain choice model
- Title not available (Why is that?)
- Variational Exposure Fusion with Optimal Local Contrast
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
- Data-driven distributionally robust risk parity portfolio optimization
- Convex optimization techniques in compliant assembly simulation
This page was built for publication: On the Goldstein-Levitin-Polyak gradient projection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090967)