Search Results - Surrogate sub-gradient algorithm

Supply chain networks design with multi-mode demand satisfaction policy by Ardalan, Zaniar, Karimi, Sajad, Naderi, B., Arshadi Khamseh, Alireza

“…•This paper deals with a supply chain network design with multi-mode demand.•The problem is mathematically formulated as mixed integer linear programming.•A…”
Get full text

Parsimonious shooting heuristic for trajectory design of connected automated traffic part II: Computational issues and optimization by Ma, Jiaqi, Li, Xiaopeng, Zhou, Fang, Hu, Jia, Park, B. Brian

“…) proposed a parsimonious shooting heuristic (SH) algorithm for constructing feasible trajectories for a stream of vehicles considering realistic constraints including…”
Get full text

A new envelope function for nonsmooth DC optimization by Themelis, Andreas, Hermans, Ben, Patrinos, Panagiotis

“…". A gradient method on this surrogate function yields a novel (sub)gradient-free proximal algorithm which is inherently parallelizable and can handle fully nonsmooth formulations…”
Get full text

A Fast and Efficient Data Association of Passive Sensor Tracking by Changning Tong, Yuesong Lin, Yunfei Guo, Yan Zuo

“… The sub gradient is applied to update the Lagrange multipliers, but it needs to minimize all the sub problems at every iterative time to solve the dual solution in the classic algorithm…”
Get full text

A new envelope function for nonsmooth DC optimization by Themelis, Andreas, Hermans, Ben, Patrinos, Panagiotis

“…". A gradient method on this surrogate function yields a novel (sub)gradient-free proximal algorithm which is inherently parallelizable and can handle fully nonsmooth formulations…”
Get full text

Large-margin classification with multiple decision rules by Kimes, Patrick K., Hayes, David Neil, Marron, J. S., Liu, Yufeng

“…Binary classification is a common statistical learning problem in which a model is estimated on a set of covariates for some outcome, indicating the membership…”
Get full text

Zeroth-order Proximal Clipped Gradient Method with Shifts for Distributed Stochastic Composite Optimization Problems with Infinite Variance by Yang, Zhen-Ping, Chen, Pin-Bo, Zhao, Yong, Chen, Lin

“…-)gradient information may be unavailable. We present a mini-batch zeroth-order proximal clipped gradient algorithm with shifts, which utilizes the well-known Gaussian smoothing technique to yield unbiased zeroth-order gradient estimators…”
Get full text

Zeroth-order Proximal Clipped Gradient Method with Shifts for Distributed Stochastic Composite Optimization Problems with Infinite Variance: Zeroth-order Proximal Clipped Gradient Method with by Yang, Zhen-Ping, Chen, Pin-Bo, Zhao, Yong, Chen, Lin

“…-)gradient information may be unavailable. We present a mini-batch zeroth-order proximal clipped gradient algorithm with shifts, which utilizes the well-known Gaussian smoothing technique to yield unbiased zeroth-order gradient estimators…”
Get full text

Large-Margin Classification with Multiple Decision Rules by Kimes, Patrick K, Hayes, D Neil, Marron, J S, Liu, Yufeng

“…Binary classification is a common statistical learning problem in which a model is estimated on a set of covariates for some outcome indicating the membership…”
Get full text

Optimization methods for regularized convex formulations in machine learning by Lee, Sang Kyun

“…We develop efficient numerical optimization algorithms for regularized convex formulations that appear in a variety of areas such as machine learning, statistics, and signal processing…”
Get full text

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization by Pougkakiotis, Spyridon, Kalogerias, Dionysios S

“… We consider nonsmooth and nonlinear stochastic composite problems, for which (sub-)gradient information might be unavailable…”
Get full text