Results 1 to 10 of about 19,030 (190)
Radial Subgradient Method [PDF]
SIAM Journal on Optimization, 2018 We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different perspective, leading to an algorithm which is conceptually more natural, has notably improved convergence rates, and for ...
Grimmer, Benjamin
openaire +4 more sources
Extragradient subgradient methods for solving bilevel equilibrium problems [PDF]
Journal of Inequalities and Applications, 2018 In this paper, we propose two algorithms for finding the solution of a bilevel equilibrium problem in a real Hilbert space. Under some sufficient assumptions on the bifunctions involving pseudomonotone and Lipschitz-type conditions, we obtain the strong ...
Tadchai Yuying +3 more
doaj +2 more sources
Barrier subgradient method [PDF]
Mathematical Programming, 2010 The author focusses on a class of problems of minimizing a nonsmooth convex function over a feasible set endowed by a self-concordant barrier. After studying the smoothing of the support function of a convex set by a self-concordant barrier, the author describes the corresponding barrier subgradient method (BSM).
NESTEROV, Y.
openaire +5 more sources
Bounded perturbation resilience of extragradient-type methods and their applications [PDF]
Journal of Inequalities and Applications, 2017 In this paper we study the bounded perturbation resilience of the extragradient and the subgradient extragradient methods for solving a variational inequality (VI) problem in real Hilbert spaces.
Q-L Dong, A Gibali, D Jiang, Y Tang
doaj +5 more sources
Primal Subgradient Methods with Predefined Step Sizes. [PDF]
J Optim Theory ApplAbstractIn this paper, we suggest a new framework for analyzing primal subgradient methods for nonsmooth convex optimization problems. We show that the classical step-size rules, based on normalization of subgradient, or on knowledge of the optimal value of the objective function, need corrections when they are applied to optimization problems with ...
Nesterov Y.
europepmc +5 more sources
Subgradient ellipsoid method for nonsmooth convex problems. [PDF]
Math Program, 2023 AbstractIn 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.
Rodomanov A, Nesterov Y.
europepmc +5 more sources
Calculation of Robot Multi-Fingered Grasping Force and Displacement Based on the Newton–Subgradient Non-Smooth Greedy Randomized Kaczmarz Method for Solving Linear Complementarity Problem [PDF]
SensorsThe calculation of grasping force and displacement is important for multi-fingered stable grasping and research on slipping damage. By linearizing the friction cone, the robot multi-fingered grasping problem can be represented as a linear complementarity
Zhiwei Ai, Chenliang Li
doaj +2 more sources
Letter to the Editor – Update from Ukraine: Development of the Cloud-based Platform for Patient-centered Telerehabilitation of Oncology Patients with Mathematical-related Modeling [PDF]
International Journal of Telerehabilitation, 2023 This Letter to the Editor provides an update on the research from the Glushkov Institute of Cybernetics of the National Academy of Sciences of Ukraine. The Institute’s research team in collaboration with Ternopil National Medical University began a new ...
Kyrylo S. Malakhov
doaj +2 more sources
Properties of the Quadratic Transformation of Dual Variables
Algorithms, 2023 We investigate a solution of a convex programming problem with a strongly convex objective function based on the dual approach. A dual optimization problem has constraints on the positivity of variables.
Vladimir Krutikov +5 more
doaj +1 more source
A Family of Multi-Step Subgradient Minimization Methods
Mathematics, 2023 For solving non-smooth multidimensional optimization problems, we present a family of relaxation subgradient methods (RSMs) with a built-in algorithm for finding the descent direction that forms an acute angle with all subgradients in the neighborhood of
Elena Tovbis +5 more
doaj +1 more source