Barrier subgradient method
DOI10.1007/S10107-010-0421-3zbMATH Open1233.90235OpenAlexW2157959686MaRDI QIDQ633113FDOQ633113
Authors: Yuri Nesterov 
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
Recommendations
- Barrier method in nonsmooth convex optimization without convex representation
- Primal-dual subgradient methods for convex problems
- An interior-point based subgradient method for nondifferentiable convex optimization
- Smooth minimization of non-smooth functions
- On some properties and an application of the logarithmic barrier method
convex optimizationstochastic optimizationminimax problemsvariational inequalitiesnon-smooth optimizationsaddle pointssubgradient methodslower complexity boundsblack-box methods
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Smooth minimization of non-smooth functions
- Introductory lectures on convex optimization. A basic course.
- Primal-dual subgradient methods for convex problems
- First-Order Methods for Sparse Covariance Selection
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Semidefinite relaxation and nonconvex quadratic optimization
- Dual extrapolation and its applications to solving variational inequalities and related problems
- The maximum concurrent flow problem
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Rounding of convex sets and efficient gradient methods for linear programming problems
- Smoothing technique and its applications in semidefinite optimization
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
Cited In (12)
- Multiresolution parameter choice method for total variation regularized tomography
- Convergence rate analysis of the multiplicative gradient method for PET-type problems
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A subgradient method for free material design
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Primal subgradient methods with predefined step sizes
- A single-phase, proximal path-following framework
- Primal-dual subgradient method for huge-scale linear conic problems
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Barrier method in nonsmooth convex optimization without convex representation
- Primal-dual subgradient methods for convex problems
This page was built for publication: Barrier subgradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633113)
