Výsledky vyhledávání - "Convex minimization"

Report

Improved global performance guarantees of second-order methods in convex minimization

Autor: Dvurechensky, Pavel, Nesterov, Yurii

In this paper, we attempt to compare two distinct branches of research on second-order optimization methods. The first one studies self-concordant functions and barriers, the main assumption being that the third derivative of the objective is bounded

Externí odkaz: http://arxiv.org/abs/2408.11022

Zobrazit plný text záznamu

Report

Online $\mathrm{L}^{\natural}$-Convex Minimization

Autor: Yokoyama, Ken, Ito, Shinji, Matsuoka, Tatsuya, Kimura, Kei, Yokoo, Makoto

An online decision-making problem is a learning problem in which a player repeatedly makes decisions in order to minimize the long-term loss. These problems that emerge in applications often have nonlinear combinatorial objective functions, and devel

Externí odkaz: http://arxiv.org/abs/2404.17158

Zobrazit plný text záznamu

Report

On existence of solutions to non-convex minimization problems

Autor: Rele, Rohan, Nedich, Angelia

We provide new sufficient conditions for the finiteness of the optimal value and existence of solutions to a general problem of minimizing a proper closed function over a nonempty closed set. The conditions require an asymptotically bounded decay of

Externí odkaz: http://arxiv.org/abs/2405.04688

Zobrazit plný text záznamu

Akademický článek

Proximal point approach for solving convex minimization problems in positive curvature.

Autor: KITKUAN, DUANGKAMON¹ duangkamon.k@rbru.ac.th, PADCHAROEN, ANANTACHAI² anantachai.p@rbru.ac.th, CALDERÓN, KENYI² kencalderon@udca.edu.co, MARTÍNEZ-MORENO, JUAN³ jmmoreno@ujaen.es

Publikováno v: Carpathian Journal of Mathematics. 2024, Vol. 40 Issue 2, p333-342. 10p.

Zobrazit plný text záznamu

Report

Accuracy Certificates for Convex Minimization with Inexact Oracle

Autor: Gladin, Egor, Gasnikov, Alexander, Dvurechensky, Pavel

Accuracy certificates for convex minimization problems allow for online verification of the accuracy of approximate solutions and provide a theoretically valid online stopping criterion. When solving the Lagrange dual problem, accuracy certificates p

Externí odkaz: http://arxiv.org/abs/2310.00523

Zobrazit plný text záznamu