On the Goldstein-Levitin-Polyak gradient projection method

Cited in

(only showing first 100 items - show all)

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
A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
Cost minimization of a multiple section power cable supplying several remote telecom equipment
The effect of perturbations on the convergence rates of optimization algorithms
On the gradient-projection method for solving the nonsymmetric linear complementarity problem
A class of superlinearly convergent projection algorithms with relaxed stepsizes
A projected Newton method for minimization problems with nonlinear inequality constraints
Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
Algorithms for bound constrained quadratic programming problems
Algorithms for a class of nondifferentiable problems
A least-distance programming procedure for minimization problems under linear constraints
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
A feasible direction algorithm for convex optimization: Global convergence rates
Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model.
Error bounds and convergence analysis of feasible descent methods: A general approach
A unified description of iterative algorithms for traffic equilibria
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
Optimal objective function approximation for separable convex quadratic programming
Family of projected descent methods for optimization problems with simple bounds
Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
Computational study of state-of-the-art path-based traffic assignment algorithms
Non-expected route choice model under risk on stochastic traffic networks
Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests
Single stage prediction with embedded topic modeling of online reviews for mobile app management
Efficient projected gradient methods for cardinality constrained optimization
Solving the combined modal split and traffic assignment problem with two types of transit impedance function
A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
On finite convergence and constraint identification of subgradient projection methods
On the convergence of projected gradient processes to singular critical points
A parallel descent algorithm for convex programming
A cyclic projected gradient method
Linear convergence analysis of the use of gradient projection methods on total variation problems
Dual fast projected gradient method for quadratic programming
Identification of the blood perfusion rate for laser-induced thermotherapy in the liver
Pareto-optimal sustainable transportation network design under spatial queuing
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
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
On the inexact scaled gradient projection method
A PDE-constrained optimization approach for topology optimization of strained photonic devices
On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
A novel projected gradient-like method for optimization problems with simple constraints
Convex optimization techniques in compliant assembly simulation
Synchronisation and control of proliferation in cycling cell population models with age structure
Learning with tensors: a framework based on convex optimization and spectral regularization
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?
Convergence analysis for the modified spectral projected subgradient method
Restricted simplicial decomposition for convex constrained problems
The active-set method for nonnegative regularization of linear ill-posed problems
Convergence of the exponentiated gradient method with Armijo line search
Shape optimization for tumor location
Global convergence of a modified gradient projection method for convex constrained problems
Perron vector optimization applied to search engines
An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
Discrete tomography by convex--concave regularization and D.C. programming
On consistency of the monotone NPMLE of survival function under the mixed case interval-censored model with left truncation
Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators
Inexact gradient projection method with relative error tolerance
Using Nesterov's method to accelerate multibody dynamics with friction and contact
Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
Cooperative adaptive sampling of random fields with partially known covariance
Applying the gradient projection method to a model of proportional membership for fuzzy cluster analysis
Accelerated Uzawa methods for convex optimization
Efficient reliable image reconstruction schemes for diffuse optical tomography
Smooth sparse coding via marginal regression for learning sparse representations
Iterative learning control for constrained linear systems
Optimal control of the temperature in a catalytic converter
Variational exposure fusion with optimal local contrast
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
Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions
Prior Learning and Convex-Concave Regularization of Binary Tomography
On the rate of convergence of projected Barzilai-Borwein methods
Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
Adaptive Relevance Matrices in Learning Vector Quantization
Computational aspects of two-segment separable programming
Convex quadratic programming with one constraint and bounded variables
Projected gradient methods for linearly constrained problems
Exact penalty algorithm for optimal control problems with control and terminal constraints
Face recognition from caption-based supervision
scientific article; zbMATH DE number 1286268 (Why is no real title available?)
A comparison of numerical methods for optimal shape design problems
Non-monotone projection gradient method for non-negative matrix factorization
An implementable proximal point algorithmic framework for nuclear norm minimization
Ergodic convergence in subgradient optimization
Strong convergence of projected reflected gradient methods for variational inequalities
Novel algorithm for non-negative matrix factorization
Optimization of a Multiphysics Problem in Semiconductor Laser Design
Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
Shape optimization by free-form deformation: existence results and numerical solution for Stokes flows

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)