Results 101 to 110 of about 1,615 (176)
Ellenberg Indicator Values Disclose Complex Environmental Filtering Processes in Plant Communities along an Elevational Gradient. [PDF]
Biology (Basel), 2023 Di Biase L +3 more
europepmc +1 more source
Nonsmooth Analysis and Subgradient Methods for Averaging in Dynamic Time Warping Spaces
, 2017 Time series averaging in dynamic time warping (DTW) spaces has been successfully applied to improve pattern recognition systems. This article proposes and analyzes subgradient methods for the problem of finding a sample mean in DTW spaces.
Schultz, David, Jain, Brijnesh
core +1 more source
Image and signal recovery via a novel alternating golden ratio two-subgradient extragradient method
Ain Shams Engineering JournalWe introduce and analyze a novel two-subgradient extragradient method (TSEGM) for solving monotone variational inequality problems (VIPs) in real Hilbert spaces.
Habib ur Rehman +3 more
doaj +1 more source
Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
This paper focuses on the problem of minimizing a locally Lipschitz continuous function. Motivated by the effectiveness of Bregman gradient methods in training nonsmooth deep neural networks and the recent progress in stochastic subgradient methods for ...
Ding, Kuangyu, Toh, Kim-Chuan
core
Subgradient optimization methods in integer programming with an application to a radiation therapy problem [PDF]
, 2003 The thesis deals with the subgradient optimization methods which are serving to solve nonsmooth optimization problems. We are particularly concerned with solving large-scale integer programming problems using the methodology of Lagrangian relaxation and ...
Guta, Berhanu, Berhanu Guta
core
Subgradient ellipsoid method for nonsmooth convex problems. [PDF]
Math Program, 2023 Rodomanov A, Nesterov Y.
europepmc +1 more source
Ergodic results in subgradient optimization
, 1996 Subgradient methods are popular tools for nonsmooth, convex minimization, especially in the context of Lagrangean relaxation; their simplicity has been a main contribution to their success.
Larsson, Torbjörn +2 more
core +1 more source
Barrier subgradient method [PDF]
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
, 1988 학위논문(박사) - 한국과학기술원 : 경영과학과, 1988.2, [ v, 129 p. ]Most large scale problems have special structures. A linear programming problem may have a block structure and a relatively small number of interaction between the subunits, some ``hard`` combinatorial ...
고석하, Koh, Seok-Ha
core
Distributed Support Vector Ordinal Regression over Networks. [PDF]
Entropy (Basel), 2022 Liu H, Tu J, Li C.
europepmc +1 more source