Inexact high-order proximal-point methods with auxiliary search procedure
Year of publication: |
[2020]
|
---|---|
Authors: | Nesterov, Jurij Evgenʹevič |
Publisher: |
Louvain-la-Neuve : CORE |
Subject: | Convex Optimization | tensor methods | proximal-point operator | lower complexity bounds | optimal methods | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Operations Research | Operations research |
-
Inexact accelerated high-order proximal-point methods
Nesterov, Jurij Evgenʹevič, (2020)
-
Exploiting separability in a multisectoral model of oligopolistic competition
Aspremont, Claude d', (2020)
-
Implementable tensor methods in unconstrained convex optimization
Nesterov, Jurij Evgenʹevič, (2018)
- More ...
-
Primal-dual interior-point methods for self-scaled cones
Nesterov, Jurij Evgenʹevič, (1995)
-
Oligopolistic competition and the optima provision of products
Anderson, Simon P., (1994)
-
Semidefinite relaxation and nonconvex quadratic optimization
Nesterov, Jurij Evgenʹevič, (1997)
- More ...