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

From feature selection to continues optimization

The proposed method, called MaNet, is motivated by the fact that most of the DL models often need to solve massive nasty optimization problems consisting of millions of parameters. Expand abstract.
3 days ago
5/10 relevant
arXiv

Minimum size generating partitions and their application to demand fulfillment optimization problems

For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. Expand abstract.
3 days ago
10/10 relevant
arXiv

An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization

We propose an inexact proximal augmented Lagrangian framework with explicit inner problem termination rule for composite convex optimization problems. Expand abstract.
3 days ago
4/10 relevant
arXiv

Shape optimization for interface identification in nonlocal models

Here we consider a class of shape optimization problems constrained by nonlocal equations which involve interface-dependent kernels. Expand abstract.
4 days ago
4/10 relevant
arXiv

A consensus-based global optimization method for high dimensional machine learning problems

We first replace the isotropic geometric Brownian motion by the component-wise one, thus removing the dimensionality dependence of the drift rate, making the method more competitive for high dimensional optimization problems. Expand abstract.
4 days ago
7/10 relevant
arXiv

Encoding Selection for Solving Hamiltonian Cycle Problems with ASP

It is common for search and optimization problems to have alternative equivalent encodings in ASP. Expand abstract.
5 days ago
4/10 relevant
arXiv

RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems

We also extend the framework to work for related optimization problems such as the maximum independent set problem (Max-IS). Expand abstract.
5 days ago
5/10 relevant
arXiv

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.
5 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.
7 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.
8 days ago
10/10 relevant
arXiv