Error Stability Properties of Generalized Gradient-Type Algorithms

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Journal of Optimization Theory and Applications

• Publication date

  1998-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1022680114518
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Incremental Gradient Algorithms with Stepsizes Bounded Away from Zero

  1998cited by this paper
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

  1998influential reference
• An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule

  1998cited by this paper
• New Inexact Parallel Variable Distribution Algorithms

  1997cited by this paper
• Convergence Analysis of Perturbed Feasible Descent Methods

  1997cited by this paper
• Descent methods with linesearch in the presence of perturbations

  1997cited by this paper
• A New Class of Incremental Gradient Methods for Least Squares Problems

  1997cited by this paper
• Nonlinear Programming

  1995cited by this paper
• On optimal ℓ∞ to ℓ∞ filtering

  1995cited by this paper
• Incremental least squares methods and the extended Kalman filter

  1994cited by this paper
• Analysis of an approximate gradient projection method with applications to the backpropagation algorithm

  1994cited by this paper
• Serial and parallel backpropagation convergence via nonmonotone perturbed minimization

  1994cited by this paper
• Mathematical Programming in Neural Networks

  1993cited by this paper
• Weak sharp minima in mathematical programming

  1993cited by this paper
• Backpropagation Convergence via Deterministic Nonmonotone Perturbed Minimization

  1993cited by this paper
• On the Convergence of the LMS Algorithm with Adaptive Learning Rate for Linear Feedforward Networks

  1991cited by this paper
• Convergence properties of the gradient method under conditions of variable-level interference

  1990cited by this paper
• Foundations of neural networks

  1990cited by this paper
• Introduction to optimization

  1987cited by this paper
• Approximate calculation of a pseudoinverse matrix using a generalized discrepancy principle

  1986cited by this paper
• Nondifferential optimization via adaptive smoothing

  1984cited by this paper
• Optimization And Nonsmooth Analysis

  1983influential reference
• Stability Theory by Liapunov's Direct Method

  1977cited by this paper
• Nonlinear Programming: A Unified Approach.

  1970cited by this paper

• Simultaneous Incremental Gradient Method for Inconsistent Convex Optimization Problem

  2025cites this paper
• Perturbed Gradient Descent Algorithms are Small-Disturbance Input-to-State Stable

  2025cites this paper
• Derivatives of Stochastic Gradient Descent

  2024cites this paper
• Inexact subgradient methods for semialgebraic functions

  2024influential citation
• Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem

  2024cites this paper
• First order inertial optimization algorithms with threshold effects associated with dry friction

  2023cites this paper
• A Family of Multi-Step Subgradient Minimization Methods

  2023cites this paper
• Ordering for Non-Replacement SGD

  2023cites this paper
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information

  2023cites this paper
• Perturbed Iterate SGD for Lipschitz Continuous Loss Functions with Numerical Error and Adaptive Step Sizes

  2022cites this paper
• Introduction

  2021cites this paper
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces

  2021cites this paper
• Convergence of Random Reshuffling Under The Kurdyka-Łojasiewicz Inequality

  2021cites this paper
• An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization

  2021cites this paper
• On the Primal Feasibility in Dual Decomposition Methods Under Additive and Bounded Errors

  2021cites this paper
• Bundle Methods for Inexact Data

  2020cites this paper
• Detection of Iterative Adversarial Attacks via Counter Attack

  2020cites this paper
• Introduction

  2020cites this paper
• Introduction

  2020cites this paper
• Weak subgradient method for solving nonsmooth nonconvex optimization problems

  2020cites this paper
• Weak subgradient algorithm for solving nonsmooth nonconvex unconstrained optimization problems

  2019cites this paper
• Incremental Methods for Weakly Convex Optimization

  2019cites this paper
• String-averaging incremental stochastic subgradient algorithms

  2018cites this paper
• An Incremental Subgradient Method on Riemannian Manifolds

  2018cites this paper
• Scaling techniques for ǫ –subgradient projection methods ∗

  2018cites this paper
• Price Convergence under a Probabilistic Double Auction

  2018influential citation
• Price Convergence under a Probabilistic Double Auction

  2018cites this paper
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds

  2017cites this paper
• ϵ-subgradient algorithms for bilevel convex optimization

  2017cites this paper
• String-averaging incremental subgradient methods for constrained convex optimization problems

  2017cites this paper
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information

  2017cites this paper
• Cyclic Stochastic Optimization: Generalizations, Convergence, and Applications in Multi-Agent Systems

  2017influential citation
• Optimisation sans dérivées sous incertitudes appliquées à des simulateurs coûteux

  2016cites this paper
• Subgradient Projection Algorithm

  2016cites this paper
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints

  2016cites this paper
• Convergence of price processes under two dynamic double auctions

  2016cites this paper
• String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images

  2016cites this paper
• Nonconvex proximal splitting with computational errors ∗

  2016cites this paper
• On the Computational Efficiency of Subgradient Methods : A Case Study in Combinatorial Optimization

  2015cites this paper
• A proximal bundle method for nonsmooth nonconvex functions with inexact information

  2015cites this paper
• Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey

  2015cites this paper
• Convergences of Price Processes Under a Probabilistic Double Auction

  2015cites this paper
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings

  2015influential citation
• PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT

  2015cites this paper
• Bounded perturbation resilience of projected scaled gradient methods

  2015cites this paper
• Computational aspects of compressed sensing

  2014cites this paper
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods

  2014cites this paper
• Double auction mechanisms on Markovian networks

  2014cites this paper
• A PROXIMAL BUNDLE METHOD FOR NONCONVEX FUNCTIONS WITH INEXACT ORACLES

  2014cites this paper
• Scaling techniques for $\epsilon$-subgradient projection methods

  2014cites this paper
• N A ] 2 3 Ju l 2 01 4 Scaling techniques for ǫ – subgradient projection methods ∗

  2014cites this paper
• Método subgradiente incremental para otimização convexa não diferenciável

  2014cites this paper
• Sparse solution of the Lyapunov equation for large-scale interconnected systems

  2014cites this paper
• Development of New Global Optimization Algorithms Using Stochastic Level Set Method with Application in: Topology Optimization, Path Planning and Image Processing

  2012cites this paper
• INEXACTNESS IN BUNDLE METHODS FOR LOCALLY LIPSCHITZ FUNCTIONS

  2012cites this paper
• Scalable nonconvex inexact proximal splitting

  2012cites this paper
• The Extragradient Method for Convex Optimization in the Presence of Computational Errors

  2012cites this paper
• An Infeasible-Point Subgradient Method using Approximate Projections

  2011cites this paper
• Nonconvex proximal splitting: batch and incremental algorithms

  2011cites this paper
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization

  2011cites this paper
• Bubbles, Crashes and Efficiency with Double Auction Mechanisms

  2011cites this paper
• The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors

  2010cites this paper
• Spiral Bacterial Foraging Optimization method

  2010cites this paper
• The effect of deterministic noise in subgradient methods

  2010cites this paper
• Incremental-like bundle methods with application to energy planning

  2010cites this paper
• Power Control With Imperfect Exchanges and Applications to Spectrum Sharing

  2010cites this paper
• Asynchronous stochastic convex optimization over random networks: Error bounds

  2010cites this paper
• Convex optimization theory

  2010cites this paper
• Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods

  2009cites this paper
• Convergence Analysis of Deflected Conditional Approximate Subgradient Methods

  2009cites this paper
• Asynchronous gossip algorithms for stochastic optimization

  2009cites this paper
• Convex Optimization Theory

  2009cites this paper
• Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization

  2008cites this paper
• A merit function approach to the subgradient method with averaging

  2008cites this paper
• THE EFFECT OF DETERMINISTIC NOISE1 IN SUBGRADIENT METHODS

  2008cites this paper
• Incremental Bundle Methods for Mid-term Power Planning.

  2008cites this paper
• Incremental Stochastic Subgradient Algorithms for Convex Optimization

  2008cites this paper
• Strong Convergence of Projected Subgradient Methods for Nonsmooth and Nonstrictly Convex Minimization

  2008cites this paper
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach

  2007cites this paper
• TWO PVT ALGORITHMS OF NONMONOTONE-TYPE

  2004cites this paper
• On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems

  2003cites this paper
• On Approximations with Finite Precision in Bundle Methods for Nonsmooth Optimization

  2003cites this paper
• Distributed Asynchronous Incremental Subgradient Methods

  2001cites this paper
• Parallel Subgradient Methods for Convex Optimization

  2001cites this paper
• INCREMENTAL SUBGRADIENT METHODS1 FOR NONDIFFERENTIABLE OPTIMIZATION

  2001cites this paper
• Convergence Rate of Incremental Subgradient Algorithms

  2001cites this paper
• Áëìêááíììì Ëëaeaeàêçaeçíë Áaeaeêêååaeìä Ëíííêêêááaeì Ååìàççë

  2000influential citation
• A Perturbed and Inexact Version of the Auxiliary Problem Method for Solving General Variational Inequalities with a Multivalued Operator

  2000cites this paper
• Incremental subgradient methods for nondifferentiable optimization

  1999cites this paper
• Reinforcement Learning Through Gradient Descent

  1999cites this paper
• Incremental Gradient Algorithms with Stepsizes Bounded Away from Zero

  1998cites this paper
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

  1998influential citation
• New Inexact Parallel Variable Distribution Algorithms

  1997cites this paper
• Descent methods with linesearch in the presence of perturbations

  1997cites this paper
• Gradient Approaches to Equilibrium

  1997cites this paper
• Convergence Analysis of Perturbed Feasible Descent Methods

  1997cites this paper
• Descent methods with linesearch in the presence of perturbations

  1997cites this paper
• Convergence Analysis of Perturbed Feasible Descent Methods 1

  1997cites this paper
• Convergence Analysis of Perturbed Feasible Descent Methods

  1997cites this paper
• MIT Open Access Articles Incremental proximal methods for large scale convex optimization

  year unknowncites this paper