Proximal Minimization Methods with Generalized Bregman Functions-Reference-Cited by-同舟云学术

Proximal Minimization Methods with Generalized Bregman Functions

Published:1997-07 Issue:4 Volume:35 Page:1142-1168
ISSN:0363-0129
Container-title:SIAM Journal on Control and Optimization
language:en
Short-container-title:SIAM J. Control Optim.

Author:

Kiwiel Krzysztof C.

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

Applied Mathematics,Control and Optimization

Link

http://epubs.siam.org/doi/pdf/10.1137/S0363012995281742

Reference37 articles.

1. Numerical methods for nondifferentiable convex optimization

2. D.Bertsekas, Uslovnaya optimizatsiya i metody mnozhitelei Lagranzha, “Radio i Svyaz\cprime”, 1987, 400–0, Translated from the English by N. V. Tretçprime yakov; Translation edited andwith a preface by E. G. Golçprime shtei˘n88j:90181

3. Partial Proximal Minimization Algorithms for Convex Pprogramming

Cited by 173 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Rate of Convergence of Bregman Proximal Methods: Local Geometry Versus Regularity Versus Sharpness;SIAM Journal on Optimization;2024-07-09

2. Lagrangian Multiplier Methods for Convex Programming;Encyclopedia of Optimization;2024

3. Proximal point method with Bregman distance for quasiconvex pseudomonotone equilibrium problems;Optimization;2023-08-29

4. A Continuous-Time Nesterov Accelerated Gradient Method for Distributed Convex Optimization with an Exponential Convergent Bregman Distance;2023 5th International Conference on Industrial Artificial Intelligence (IAI);2023-08-21

5. No-regret Caching via Online Mirror Descent;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2023-08-11