On the Goldstein-Levitin-Polyak gradient projection method
From MaRDI portal
Publication:4090967
DOI10.1109/TAC.1976.1101194zbMath0326.49025MaRDI QIDQ4090967
Publication date: 1976
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Computational study of state-of-the-art path-based traffic assignment algorithms ⋮ Iterative learning control for constrained linear systems ⋮ Restricted simplicial decomposition for convex constrained problems ⋮ A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods ⋮ The active-set method for nonnegative regularization of linear ill-posed problems ⋮ Optimal objective function approximation for separable convex quadratic programming ⋮ Smooth sparse coding via marginal regression for learning sparse representations ⋮ A projected Newton method for minimization problems with nonlinear inequality constraints ⋮ Optimal control of the temperature in a catalytic converter ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ Non-expected route choice model under risk on stochastic traffic networks ⋮ Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities ⋮ Computational enhancements to fluence map optimization for total marrow irradiation using IMRT ⋮ Computation and application of the paired combinatorial logit stochastic user equilibrium problem ⋮ A modified gradient projection algorithm for solving the elastic demand traffic assignment problem ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ Family of projected descent methods for optimization problems with simple bounds ⋮ A parallel descent algorithm for convex programming ⋮ A conjugate gradient projection algorithm for the traffic assignment problem ⋮ Algorithms for bound constrained quadratic programming problems ⋮ A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising ⋮ Spectral projected subgradient with a momentum term for the Lagrangean dual approach ⋮ On consistency of the monotone NPMLE of survival function under the mixed case interval-censored model with left truncation ⋮ Coupling the auxiliary problem principle with descent methods of pseudoconvex programming ⋮ Algorithms for a class of nondifferentiable problems ⋮ Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators ⋮ Convergence of the exponentiated gradient method with Armijo line search ⋮ A novel projected gradient-like method for optimization problems with simple constraints ⋮ Face recognition from caption-based supervision ⋮ Applying the Gradient Projection Method to a Model of Proportional Membership for Fuzzy Cluster Analysis ⋮ New step lengths in projection method for variational inequality problems ⋮ Shape optimization for tumor location ⋮ A cyclic projected gradient method ⋮ Linear convergence analysis of the use of gradient projection methods on total variation problems ⋮ Non-monotone projection gradient method for non-negative matrix factorization ⋮ Global convergence of a modified gradient projection method for convex constrained problems ⋮ Dual fast projected gradient method for quadratic programming ⋮ An implementable proximal point algorithmic framework for nuclear norm minimization ⋮ Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests ⋮ Accelerated Uzawa methods for convex optimization ⋮ Inexact gradient projection method with relative error tolerance ⋮ Convex optimization techniques in compliant assembly simulation ⋮ A least-distance programming procedure for minimization problems under linear constraints ⋮ Perron vector optimization applied to search engines ⋮ Shape optimization by free-form deformation: existence results and numerical solution for Stokes flows ⋮ Single stage prediction with embedded topic modeling of online reviews for mobile app management ⋮ Efficient projected gradient methods for cardinality constrained optimization ⋮ Synchronisation and control of proliferation in cycling cell population models with age structure ⋮ Variational Exposure Fusion with Optimal Local Contrast ⋮ Solution of projection problems over polytopes ⋮ Identification of the blood perfusion rate for laser-induced thermotherapy in the liver ⋮ A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming ⋮ Efficient reliable image reconstruction schemes for diffuse optical tomography ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ Computing the generalized eigenvalues of weakly symmetric tensors ⋮ Numerical approach to monotone variational inequalities by a one-step projected reflected gradient method with line-search procedure ⋮ Solving the combined modal split and traffic assignment problem with two types of transit impedance function ⋮ Learning with tensors: a framework based on convex optimization and spectral regularization ⋮ A Kronecker approximation with a convex constrained optimization method for blind image restoration ⋮ Convex constrained optimization for large-scale generalized Sylvester equations ⋮ A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem ⋮ Pareto-optimal sustainable transportation network design under spatial queuing ⋮ Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming ⋮ Sample size selection in optimization methods for machine learning ⋮ Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints ⋮ On the interplay between acceleration and identification for the proximal gradient algorithm ⋮ Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization ⋮ Convergence of a projected gradient method variant for quasiconvex objectives ⋮ A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models ⋮ Realization of a framework for simulation-based large-scale shape optimization using vertex morphing ⋮ Convergence of one-step projected gradient methods for variational inequalities ⋮ Using Nesterov's Method to Accelerate Multibody Dynamics with Friction and Contact ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ A feasible direction algorithm for convex optimization: Global convergence rates ⋮ Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization ⋮ On finite convergence and constraint identification of subgradient projection methods ⋮ On iterative algorithms for linear least squares problems with bound constraints ⋮ A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities ⋮ ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern? ⋮ Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model. ⋮ Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems ⋮ Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model ⋮ On the convergence of projected gradient processes to singular critical points ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ On the inexact scaled gradient projection method ⋮ A PDE-constrained optimization approach for topology optimization of strained photonic devices ⋮ Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem ⋮ Cost minimization of a multiple section power cable supplying several remote telecom equipment ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches ⋮ The effect of perturbations on the convergence rates of optimization algorithms ⋮ Discrete tomography by convex--concave regularization and D.C. programming ⋮ On the gradient-projection method for solving the nonsymmetric linear complementarity problem ⋮ Cooperative adaptive sampling of random fields with partially known covariance ⋮ A class of superlinearly convergent projection algorithms with relaxed stepsizes ⋮ Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions ⋮ Error bounds and convergence analysis of feasible descent methods: A general approach ⋮ Finite convergence of algorithms for nonlinear programs and variational inequalities ⋮ A unified description of iterative algorithms for traffic equilibria ⋮ Convergence analysis for the modified spectral projected subgradient method
This page was built for publication: On the Goldstein-Levitin-Polyak gradient projection method
