Results 1 to 10 of about 22,536 (196)
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
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
Pathological Subgradient Dynamics [PDF]
SIAM Journal on Optimization, 2020 We construct examples of Lipschitz continuous functions, with pathological subgradient dynamics both in continuous and discrete time. In both settings, the iterates generate bounded trajectories, and yet fail to detect any (generalized) critical points of the function.
Aris Daniilidis, Dmitriy Drusvyatskiy
openaire +3 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
One method for minimization a convex Lipschitz-continuous function of two variables on a fixed square [PDF]
Компьютерные исследования и моделирование, 2019 In the article we have obtained some estimates of the rate of convergence for the recently proposed by Yu. E.Nesterov method of minimization of a convex Lipschitz-continuous function of two variables on a square with a fixed side.
Dmitry Arkad'evich Pasechnyuk +1 more
doaj +1 more source
Constructing a subgradient from directional derivatives for functions of two variables [PDF]
Journal of Nonsmooth Analysis and Optimization, 2020 For any scalar-valued bivariate function that is locally Lipschitz continuous and directionally differentiable, it is shown that a subgradient may always be constructed from the function's directional derivatives in the four compass directions, arranged ...
Kamil A. Khan, Yingwei Yuan
doaj +1 more source
On Subgradient Projectors [PDF]
SIAM Journal on Optimization, 2015 The subgradient projector is of considerable importance in convex optimization because it plays the key role in Polyak's seminal work - and the many papers it spawned - on subgradient projection algorithms for solving convex feasibility problems. In this paper, we offer a systematic study of the subgradient projector.
Bauschke, Heinz H. +3 more
openaire +2 more sources
Mathematics, 2020 The projected subgradient algorithms can be considered as an improvement of the projected algorithms and the subgradient algorithms for the equilibrium problems of the class of monotone and Lipschitz continuous operators.
Yonghong Yao +2 more
doaj +1 more source
IEEE Open Journal of the Communications Society, 2020 This paper studies the problem of energy efficiency (EE) maximization via user association, power, and backhaul (BH) flow control in the downlink of millimeter wave BH heterogeneous networks.
Sylvester Aboagye +2 more
doaj +1 more source
Mathematics, 2022 The paper develops a modified inertial subgradient extragradient method to find a solution to the variational inequality problem over the set of common solutions to the variational inequality and null point problems.
Yanlai Song, Omar Bazighifan
doaj +1 more source