Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
From MaRDI portal
Publication:3949589
DOI10.1137/0319022zbMath0488.49015OpenAlexW2070815098MaRDI QIDQ3949589
No author found.
Publication date: 1981
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0319022
Numerical mathematical programming methods (65K05) Programming in abstract spaces (90C48) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Methods of reduced gradient type (90C52) Inner product spaces and their generalizations, Hilbert spaces (46C99)
Related Items
A projected Newton method for minimization problems with nonlinear inequality constraints, Optimal control of the temperature in a catalytic converter, On the rate of convergence of projected Barzilai–Borwein methods, Convergence of algorithms for perturbed optimization problems, Iterative Methods for the Elastography Inverse Problem of Locating Tumors, Error bounds in mathematical programming, Algorithms for bound constrained quadratic programming problems, Model Reduction by Adaptive Discretization in Optimal Control, An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization, A gradient descent method for estimating the Markov chain choice model, A preconditioner for a kind of coupled FEM-BEM variational inequality, Optimal Control of the Landau–de Gennes Model of Nematic Liquid Crystals, Projected gradient methods for linearly constrained problems, Global convergence of a modified gradient projection method for convex constrained problems, On solving simple bilevel programs with a nonconvex lower level program, A new approximation of the matrix rank function and its application to matrix rank minimization, Solution of projection problems over polytopes, Hyperlink regression via Bregman divergence, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, On Regularization and Active-set Methods with Complexity for Constrained Optimization, On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions, Ergodic convergence in subgradient optimization, Solving variational inequality and fixed point problems by line searches and potential optimization, Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions, An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space, Modified Landweber Iteration in Banach Spaces—Convergence and Convergence Rates, Linear convergence of iterative soft-thresholding, On finite convergence and constraint identification of subgradient projection methods, A smoothing augmented Lagrangian method for solving simple bilevel programs, A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem, An iterative method for ill-posed problems with inequalities, On iterative algorithms for linear least squares problems with bound constraints, The effect of perturbations on the convergence rates of optimization algorithms, Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs, A class of superlinearly convergent projection algorithms with relaxed stepsizes, Convergent stepsizes for constrained optimization algorithms, Error bounds and convergence analysis of feasible descent methods: A general approach, Minimization of non-smooth, non-convex functionals by iterative thresholding, Finite convergence of algorithms for nonlinear programs and variational inequalities, A comparison of numerical methods for optimal shape design problems, Interior point methods for optimal control of discrete time systems
