scientific article
From MaRDI portal
Publication:3809587
zbMath0659.90068MaRDI QIDQ3809587
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rate of convergenceconstrained optimizationstrictly convex functionoptimal estimateconstruction of optimal algorithmsminimizing smooth convex functions
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related Items
Credible autocoding of convex optimization algorithms, A globally convergent primal-dual interior point algorithm for convex programming, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients, Exact gradient methods with memory, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, First-order methods of smooth convex optimization with inexact oracle, Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization, An accelerated inexact proximal point algorithm for convex minimization, Convergence rates of gradient methods for convex optimization in the space of measures, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, On mathematical modeling in image reconstruction and beyond, An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming, A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results, On FISTA with a relative error rule, Convergence of a proximal point algorithm for solving minimization problems, Accelerated proximal point method for maximally monotone operators, An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods, Templates for convex cone problems with applications to sparse signal recovery, Group Regularized Estimation Under Structural Hierarchy, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Accelerated Bregman proximal gradient methods for relatively smooth convex optimization, Convergence analysis of some methods for minimizing a nonsmooth convex function, Provable accelerated gradient method for nonconvex low rank optimization, Iterative Proportional Scaling Revisited: A Modern Optimization Perspective, Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis, Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Efficiency of minimizing compositions of convex functions and smooth maps, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, Unnamed Item, Augmented Lagrangian algorithms for linear programming
