Inexact accelerated high-order proximal-point methods
نویسندگان
چکیده
Abstract In this paper, we present a new framework of bi-level unconstrained minimization for development accelerated methods in Convex Programming. These use approximations the high-order proximal points, which are solutions some auxiliary parametric optimization problems. For computing these can different methods, and, particular, lower-order schemes. This opens possibility latter to overpass traditional limits Complexity Theory. As an example, obtain second-order method with convergence rate $$O\left( k^{-4}\right) $$ O k - 4 , where k is iteration counter. better than maximal possible type as applied functions Lipschitz continuous Hessian. We also exact search procedure, have k^{-(3p+1)/ 2}\right) ( 3 p + 1 ) / 2 $$p \ge 1$$ ≥ order operator. The problem at each schemes convex.
منابع مشابه
Inexact and accelerated proximal point algorithms
We present inexact accelerated proximal point algorithms for minimizing a proper lower semicontinuous and convex function. We carry on a convergence analysis under different types of errors in the evaluation of the proximity operator, and we provide corresponding convergence rates for the objective function values. The proof relies on a generalization of the strategy proposed in [14] for genera...
متن کاملSelf-adaptive inexact proximal point methods
We propose a class of self-adaptive proximal point methods suitable for degenerate optimization problems where multiple minimizers may exist, or where the Hessian may be singular at a local minimizer. If the proximal regularization parameter has the form μ(x)= β‖∇f (x)‖η where η ∈ [0,2) and β > 0 is a constant, we obtain convergence to the set of minimizers that is linear for η= 0 and β suffici...
متن کاملAn Accelerated Inexact Proximal Point Algorithm for Convex Minimization
The proximal point algorithm (PPA) is classical and popular in the community of Optimization. In practice, inexact PPAs which solves the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact PPA with a new inexact criterion for solving convex minimization, and show that the iteration-complexity of this...
متن کاملInexact accelerated augmented Lagrangian methods
The augmented Lagrangian method is a popular method for solving linearly constrained convex minimization problem and has been used many applications. In recently, the accelerated version of augmented Lagrangian method was developed. The augmented Lagrangian method has the subproblem and dose not have the closed form solution in general. In this talk, we propose the inexact version of accelerate...
متن کاملInexact Halpern-type proximal point algorithm
We present several strong convergence results for the modified, Halpern-type, proximal point algorithm xn+1 = αnu + (1 − αn)Jβn xn + en (n = 0, 1, . . .; u, x0 ∈ H given, and Jβn = (I + βn A)−1, for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on αn ∈ (0, 1) and βn ∈ (0,∞). These conditions are weaker than those known to us and our results extend and impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2021
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-021-01727-x