Contractility of continuous optimization

09/03/2019
by   Xiaopeng Luo, et al.
0

By introducing the concept of contractility, all the possible continuous optimization problems are divided into three categories: logarithmic time contractile, polynomial time contractile, or noncontractile. For the first two, we propose an efficient contraction algorithm to find the set of all global minimizers with a theoretical guarantee of linear convergence; for the last one, we discuss possible troubles caused by using the proposed algorithm.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/03/2019

Continuous optimization

Sufficient conditions for the existence of efficient algorithms are esta...
09/03/2019

Contraction methods for continuous optimization

We describe a class of algorithms that establishes a contracting sequenc...
02/25/2016

Firefly Algorithm for optimization problems with non-continuous variables: A Review and Analysis

Firefly algorithm is a swarm based metaheuristic algorithm inspired by t...
04/10/2018

End of Potential Line

We introduce the problem EndOfPotentialLine and the corresponding comple...
09/21/2021

An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems

In a widely studied class of multi-parametric optimization problems, the...
09/16/2019

Fast Large-Scale Discrete Optimization Based on Principal Coordinate Descent

Binary optimization, a representative subclass of discrete optimization,...
01/04/2018

Discrete symbolic optimization and Boltzmann sampling by continuous neural dynamics: Gradient Symbolic Computation

Gradient Symbolic Computation is proposed as a means of solving discrete...

Code Repositories

contropt

Contractility of continuous optimization


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.