Results 1 to 10 of about 19,578 (192)

Radial Subgradient Method [PDF]

SIAM Journal on Optimization, 2017
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.
Grimmer, Benjamin
core   +3 more sources

Barrier subgradient method [PDF]

Mathematical Programming, 2010
In this paper we develop a new primal-dual subgradient method for nonsmooth convex optimization problems. This scheme is based on a self-concordant barrier for the basic feasible set. It is suitable for finding approximate solutions with certain relative
NESTEROV, Y.
core   +4 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

Distributed Support Vector Ordinal Regression over Networks [PDF]

Entropy, 2022
Ordinal regression methods are widely used to predict the ordered labels of data, among which support vector ordinal regression (SVOR) methods are popular because of their good generalization.
Huan Liu, Jiankai Tu, Chunguang Li
doaj   +2 more sources

Primal Subgradient Methods with Predefined Step Sizes. [PDF]

J Optim Theory Appl
AbstractIn 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

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]

Sensors
The 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

A Subgradient Method for Free Material Design [PDF]

SIAM Journal on Optimization, 2016
A small improvement in the structure of the material could save the manufactory a lot of money. The free material design can be formulated as an optimization problem.
Kocvara, Michal, Nesterov, Yurii, Xia, Yu   +2 more
core   +4 more sources

About the Subgradient Method for Equilibrium Problems

Mathematics
Convergence results of the subgradient algorithm for equilibrium problems were mainly obtained using a Lipschitz continuity assumption on the given bifunctions. In this paper, we first provide a complexity result for monotone equilibrium problems without
Abdellatif Moudafi
doaj   +3 more sources

Modified Inertial Subgradient Extragradient Method with Regularization for Variational Inequality and Null Point Problems

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

On Mann-Type Subgradient-like Extragradient Method with Linear-Search Process for Hierarchical Variational Inequalities for Asymptotically Nonexpansive Mappings

Mathematics, 2021
We propose two Mann-type subgradient-like extra gradient iterations with the line-search procedure for hierarchical variational inequality (HVI) with the common fixed-point problem (CFPP) constraint of finite family of nonexpansive mappings and an ...
Lu-Chuan Ceng, Jen-Chih Yao, Yekini Shehu   +2 more
doaj   +1 more source