A weighted mirror descent algorithm for nonsmooth convex optimization problem
DOI10.1007/S10957-016-0963-5zbMATH Open1348.90464DBLPjournals/jota/LuongPRR16OpenAlexW2444301330WikidataQ59474421 ScholiaQ59474421MaRDI QIDQ328453FDOQ328453
Authors: Duy V. N. Luong, Panos Parpas, Daniel Rueckert, Berç Rustem 
Publication date: 20 October 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0963-5
Recommendations
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)
Cites Work
- Title not available (Why is that?)
- Markov Random Field Modeling in Image Analysis
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- The ordered subsets mirror descent optimization method with applications to tomography
- Title not available (Why is that?)
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Title not available (Why is that?)
- Proximal Minimization Methods with Generalized Bregman Functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Proximal minimization algorithm with \(D\)-functions
- An analysis of convex relaxations for MAP estimation of discrete MRFs
Cited In (5)
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- On modification of an adaptive stochastic mirror descent algorithm for convex optimization problems with functional constraints
- Analogues of switching subgradient schemes for relatively Lipschitz-continuous convex programming problems
- Mirror-Descent Methods in Mixed-Integer Convex Optimization
This page was built for publication: A weighted mirror descent algorithm for nonsmooth convex optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328453)
