A proximal-like algorithm for a class of nonconvex programming

Jein Shan Chen, Shaohua Pan

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this paper, we study a proximal-like algorithm for minimizing a closed proper function f(x) subject to x30, based on the iterative scheme: xk ε argmin{f(x) + μkd(x, xk-1)}, where d( , ) is an entropy-like distance function. The algorithm is well-defined under the assumption that the problem has a nonempty and bounded solution set. If, in addition, f is a differentiable quasi-convex function (or f is a differentiable function which is homogeneous with respect to a solution), we show that the sequence generated by the algorithm is convergent (or bounded), and furthermore, it converges to a solution of the problem (or every accumulation point is a solution of the problem) when the parameter μk approaches to zero. Preliminary numerical results are also reported, which further verify the theoretical results obtained.

Original languageEnglish
Pages (from-to)319-333
Number of pages15
JournalPacific Journal of Optimization
Volume4
Issue number2
Publication statusPublished - 2008 May 1

Fingerprint

Nonconvex Programming
Differentiable
Quasiconvex Functions
Accumulation point
Bounded Solutions
Bounded Set
Distance Function
Iterative Scheme
Solution Set
Well-defined
Entropy
Verify
Converge
Closed
Numerical Results
Zero
Class

Keywords

  • Entropy-like distance
  • Homogeneous
  • Proximal algorithm
  • Quasi-convex

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

Cite this

A proximal-like algorithm for a class of nonconvex programming. / Chen, Jein Shan; Pan, Shaohua.

In: Pacific Journal of Optimization, Vol. 4, No. 2, 01.05.2008, p. 319-333.

Research output: Contribution to journalArticle

@article{c9686e733f8a4377bc2df2c83f30cb5e,
title = "A proximal-like algorithm for a class of nonconvex programming",
abstract = "In this paper, we study a proximal-like algorithm for minimizing a closed proper function f(x) subject to x30, based on the iterative scheme: xk ε argmin{f(x) + μkd(x, xk-1)}, where d( , ) is an entropy-like distance function. The algorithm is well-defined under the assumption that the problem has a nonempty and bounded solution set. If, in addition, f is a differentiable quasi-convex function (or f is a differentiable function which is homogeneous with respect to a solution), we show that the sequence generated by the algorithm is convergent (or bounded), and furthermore, it converges to a solution of the problem (or every accumulation point is a solution of the problem) when the parameter μk approaches to zero. Preliminary numerical results are also reported, which further verify the theoretical results obtained.",
keywords = "Entropy-like distance, Homogeneous, Proximal algorithm, Quasi-convex",
author = "Chen, {Jein Shan} and Shaohua Pan",
year = "2008",
month = "5",
day = "1",
language = "English",
volume = "4",
pages = "319--333",
journal = "Pacific Journal of Optimization",
issn = "1348-9151",
publisher = "Yokohama Publications",
number = "2",

}

TY - JOUR

T1 - A proximal-like algorithm for a class of nonconvex programming

AU - Chen, Jein Shan

AU - Pan, Shaohua

PY - 2008/5/1

Y1 - 2008/5/1

N2 - In this paper, we study a proximal-like algorithm for minimizing a closed proper function f(x) subject to x30, based on the iterative scheme: xk ε argmin{f(x) + μkd(x, xk-1)}, where d( , ) is an entropy-like distance function. The algorithm is well-defined under the assumption that the problem has a nonempty and bounded solution set. If, in addition, f is a differentiable quasi-convex function (or f is a differentiable function which is homogeneous with respect to a solution), we show that the sequence generated by the algorithm is convergent (or bounded), and furthermore, it converges to a solution of the problem (or every accumulation point is a solution of the problem) when the parameter μk approaches to zero. Preliminary numerical results are also reported, which further verify the theoretical results obtained.

AB - In this paper, we study a proximal-like algorithm for minimizing a closed proper function f(x) subject to x30, based on the iterative scheme: xk ε argmin{f(x) + μkd(x, xk-1)}, where d( , ) is an entropy-like distance function. The algorithm is well-defined under the assumption that the problem has a nonempty and bounded solution set. If, in addition, f is a differentiable quasi-convex function (or f is a differentiable function which is homogeneous with respect to a solution), we show that the sequence generated by the algorithm is convergent (or bounded), and furthermore, it converges to a solution of the problem (or every accumulation point is a solution of the problem) when the parameter μk approaches to zero. Preliminary numerical results are also reported, which further verify the theoretical results obtained.

KW - Entropy-like distance

KW - Homogeneous

KW - Proximal algorithm

KW - Quasi-convex

UR - http://www.scopus.com/inward/record.url?scp=79958202210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79958202210&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:79958202210

VL - 4

SP - 319

EP - 333

JO - Pacific Journal of Optimization

JF - Pacific Journal of Optimization

SN - 1348-9151

IS - 2

ER -