Found 1606 results, showing the newest relevant preprints. Sort by relevancy only.Update me on new preprints

A Compressed Coding Scheme for Evolutionary Algorithms in Mixed-Integer Programming: A Case Study on Multi-Objective Constrained Portfolio Optimization

Hence, the Multi-Objective Evolutionary Algorithm (MOEA), which does not require the gradient information and is efficient at dealing with the multi-objective optimization problems, is adopted frequently for these problems. Expand abstract.
85 days ago
8/10 relevant
arXiv

On optimum design of frame structures

Finally, we solve three sample optimization problems and conclude that the local optimization approaches may indeed converge to local optima, without any solution quality measure, or even to infeasible points. Expand abstract.
87 days ago
7/10 relevant
arXiv

Learning adiabatic quantum algorithms for solving optimization problems

In this paper we propose a hybrid quantum-classical algorithm to solve optimization problems with an adiabatic machine assuming restrictions on the class of available problem Hamiltonians. Expand abstract.
88 days ago
10/10 relevant
arXiv

Copositive certificates of non-negativity for polynomials on semialgebraic sets

Last but not least, copositive certificates can be used to obtain not only hierarchies of tractable lower bounds, but also hierarchies of tractable upper bounds for polynomial optimization problems. Expand abstract.
89 days ago
5/10 relevant
arXiv

Optimization Based Motion Planning for Multi-Limbed Vertical Climbing Robots

The first part can be formulated as either a mixed-integer convex programming (MICP) or NLP problem, while the second part is formulated as a series of standard convex optimization problems. Expand abstract.
90 days ago
4/10 relevant
arXiv

Riemannian Proximal Gradient Methods

In the Euclidean setting the proximal gradient method and its accelerated variants are a class of efficient algorithms for optimization problems with decomposable objective. Expand abstract.
90 days ago
5/10 relevant
arXiv

Collective dynamics of phase-repulsive oscillators solves graph coloring problem

Recent years saw a fast development of quantum algorithms that solve combinatorial optimization problems, such as graph coloring, by finding the ground state of a suitable quantum system. Expand abstract.
90 days ago
7/10 relevant
arXiv

On existence of optimal potentials on unbounded domains

These problems can be seen as the natural extension of shape optimization problems to the framework of potentials. Expand abstract.
90 days ago
7/10 relevant
arXiv

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

We study an online linear programming (OLP) problem under a random input model in which the columns of the constraint matrix along with the corresponding coefficients in the objective function are generated i.i.d. from an unknown distribution and revealed sequentially over time. Expand abstract.
91 days ago
4/10 relevant
arXiv

Extending FISTA to Riemannian Optimization for Sparse PCA

Since the optimization problem is essentially non-convex, a safeguard strategy is introduced in the algorithm. Expand abstract.
91 days ago
4/10 relevant
arXiv