A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59474421, #quickstatements; #temporary_batch_1711055989931
Created claim: DBLP publication ID (P1635): journals/jota/LuongPRR16, #quickstatements; #temporary_batch_1731505720702
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic, primal convergence in dual subgradient schemes for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Minimization Methods with Generalized Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Random Field Modeling in Image Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal minimization algorithm with \(D\)-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jota/LuongPRR16 / rank
 
Normal rank

Revision as of 14:52, 13 November 2024

scientific article
Language Label Description Also known as
English
A weighted mirror descent algorithm for nonsmooth convex optimization problem
scientific article

    Statements

    Identifiers