Ergodic convergence in subgradient optimization
From MaRDI portal
Publication:4391290
DOI10.1080/10556789808805688zbMath0904.90131OpenAlexW2032606187MaRDI QIDQ4391290
Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg
Publication date: 19 January 1999
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805688
Lagrange multiplierslower bounding procedureconditional subgradient optimizationergodic sequence of subgradientsnonsmooth, convex program
Related Items (10)
An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration ⋮ On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems ⋮ A merit function approach to the subgradient method with averaging ⋮ Iteration complexity analysis of dual first-order methods for conic convex programming ⋮ Two ``well-known properties of subgradient optimization ⋮ A Lagrangian relaxation approach to large-scale flow interception problems ⋮ Subgradient methods for saddle-point problems
Cites Work
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Nondifferentiable optimization: motivations and applications. Proceedings of an IIASA (International Institute for Applied Systems Analysis) Workshop on Nondifferentiable Optimization Held at Sopron, Hungary, September 17-22, 1984
- Conditional subgradient optimization -- theory and applications
- On the convergence of projected gradient processes to singular critical points
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Characterization of solution sets of convex programs
- Stochastic approximation method with gradient averaging for unconstrained problems
- Projected gradient methods for linearly constrained problems
- On the Identification of Active Constraints
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- On the Goldstein-Levitin-Polyak gradient projection method
- Exposing Constraints
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ergodic convergence in subgradient optimization
