Barrier subgradient method
From MaRDI portal
Publication:633113
DOI10.1007/s10107-010-0421-3zbMath1233.90235OpenAlexW2157959686MaRDI QIDQ633113
Publication date: 31 March 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2078.1/19673
stochastic optimizationvariational inequalitiesconvex optimizationminimax problemssaddle pointssubgradient methodsnon-smooth optimizationlower complexity boundsblack-box methods
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)
Related Items (8)
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization ⋮ Multiresolution Parameter Choice Method for Total Variation Regularized Tomography ⋮ An inexact interior-point Lagrangian decomposition algorithm with inexact oracles ⋮ Convergence rate analysis of the multiplicative gradient method for PET-type problems ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ Bundle methods for sum-functions with ``easy components: applications to multicommodity network design ⋮ A Single-Phase, Proximal Path-Following Framework ⋮ A Subgradient Method for Free Material Design
Cites Work
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Smoothing technique and its applications in semidefinite optimization
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- Introductory lectures on convex optimization. A basic course.
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- The maximum concurrent flow problem
- First-Order Methods for Sparse Covariance Selection
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Semidefinite relaxation and nonconvex quadratic optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Rounding of convex sets and efficient gradient methods for linear programming problems
This page was built for publication: Barrier subgradient method
