Cargando…
Subgradient ellipsoid method for nonsmooth convex problems
In this paper, we present a new ellipsoid-type algorithm for solving nonsmooth problems with convex structure. Examples of such problems include nonsmooth convex minimization problems, convex-concave saddle-point problems and variational inequalities with monotone operator. Our algorithm can be seen...
Autores principales: | Rodomanov, Anton, Nesterov, Yurii |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10121548/ https://www.ncbi.nlm.nih.gov/pubmed/37155414 http://dx.doi.org/10.1007/s10107-022-01833-4 |
Ejemplares similares
-
Implementable tensor methods in unconstrained convex optimization
por: Nesterov, Yurii
Publicado: (2019) -
The projected subgradient algorithm in convex optimization
por: Zaslavski, Alexander J
Publicado: (2020) -
Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
por: Ansari, Qamrul Hasan
Publicado: (2013) -
Extragradient subgradient methods for solving bilevel equilibrium problems
por: Yuying, Tadchai, et al.
Publicado: (2018) -
Local convergence of tensor methods
por: Doikov, Nikita, et al.
Publicado: (2021)