The Log-Exponential Smoothing Technique and Nesterov's Accelerated Gradient Method for Generalized Sylvester Problems

被引：6

作者：

Nguyen Thai An ^{[1
]}

Giles, Daniel ^{[2
]}

Nguyen Mau Nam ^{[2
]}

Rector, R. Blake ^{[2
]}

机构：

[1] Thua Thien Hue Coll Educ, 123 Nguyen Hue, Hue City, Vietnam

[2] Portland State Univ, Fariborz Maseeh Dept Math & Stat, POB 751, Portland, OR 97207 USA

来源：

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 2016年 / 168卷 / 02期

基金：

美国国家科学基金会;

关键词：

Log-exponential smoothing technique; Majorization minimization algorithm; Nesterov's accelerated gradient method; Generalized Sylvester problem; SMALLEST ENCLOSING BALL; ALGORITHMS;

D O I：

10.1007/s10957-015-0811-z

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Sylvester or smallest enclosing circle problem involves finding the smallest circle enclosing a finite number of points in the plane. We consider generalized versions of the Sylvester problem in which the points are replaced by sets. Based on the log-exponential smoothing technique and Nesterov's accelerated gradient method, we present an effective numerical algorithm for solving these problems.

引用

页码：559 / 583

页数：25

共 3 条

[1] The Log-Exponential Smoothing Technique and Nesterov’s Accelerated Gradient Method for Generalized Sylvester Problems
Nguyen Thai An
Daniel Giles
Nguyen Mau Nam
R. Blake Rector
Journal of Optimization Theory and Applications, 2016, 168 : 559 - 583
[2] On the transient growth of Nesterov's accelerated method for strongly convex optimization problems
Samuelson, Samantha
Mohammadi, Hesameddin
Jovanovic, Mihailo R.
2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 5911 - 5916
[3] Performance of noisy Nesterov's accelerated method for strongly convex optimization problems
Mohammadi, Hesameddin
Razaviyayn, Meisam
Jovanovic, Mihailo R.
2019 AMERICAN CONTROL CONFERENCE (ACC), 2019, : 3426 - 3431

← 1 →