Convergence rates of subgradient methods for quasi-convex optimization problems
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Convergence rates of subgradient methods for quasi-convex optimization problems
Authors
Keywords
-
Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2020-05-15
DOI
10.1007/s10589-020-00194-y
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Faster subgradient methods for functions with Hölderian growth
- (2019) Patrick R. Johnstone et al. MATHEMATICAL PROGRAMMING
- Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems
- (2019) Jifeng Bao et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- A Linear Scalarization Proximal Point Method for Quasiconvex Multiobjective Minimization
- (2019) Erik Alex Papa Quiroz et al. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
- Dual subgradient method with averaging for optimal resource allocation
- (2018) Yu. Nesterov et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Abstract convergence theorem for quasi-convex optimization problems with applications
- (2018) Carisa Kwok Wai Yu et al. OPTIMIZATION
- Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate
- (2018) Aryan Mokhtari et al. SIAM JOURNAL ON OPTIMIZATION
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- (2017) Jinhua Wang et al. INVERSE PROBLEMS
- A unified approach to error bounds for structured convex optimization problems
- (2017) Zirui Zhou et al. MATHEMATICAL PROGRAMMING
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- (2017) Robert M. Freund et al. MATHEMATICAL PROGRAMMING
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- (2017) M. Gürbüzbalaban et al. SIAM JOURNAL ON OPTIMIZATION
- From error bounds to the complexity of first-order descent methods for convex functions
- (2016) Jérôme Bolte et al. MATHEMATICAL PROGRAMMING
- Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination
- (2016) Jinhua Wang et al. SIAM JOURNAL ON OPTIMIZATION
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- (2016) Yaohua Hu et al. SIAM JOURNAL ON OPTIMIZATION
- An inexact proximal method for quasiconvex minimization
- (2015) E.A. Papa Quiroz et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Inexact subgradient methods for quasi-convex optimization problems
- (2015) Yaohua Hu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A scalarization proximal point method for quasiconvex multiobjective minimization
- (2015) H. C. F. Apolinário et al. JOURNAL OF GLOBAL OPTIMIZATION
- Portfolio Optimization with Quasiconvex Risk Measures
- (2015) Elisa Mastrogiacomo et al. MATHEMATICS OF OPERATIONS RESEARCH
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- (2011) E.A. Papa Quiroz et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Subgradient Methods for Saddle-Point Problems
- (2009) A. Nedić et al. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- (2009) Elias Salomão Helou Neto et al. SIAM JOURNAL ON OPTIMIZATION
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- (2007) E.A. Papa Quiroz et al. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search