相关论文: Algebraic solution of minimax single-facility cons…
This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of…
Optimization of low-thrust trajectories that involve a larger number of orbit revolutions is considered a challenging problem. This paper describes a high-precision symplectic method and optimization techniques to solve the minimum-energy…
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with…
This paper addresses the critical problem of co-optimizing the optimal locations for orbital depots and the sequence of in-space servicing for a satellite constellation. While most traditional studies used network optimization for this…
Multidimensional optimization problems where the objective function and the constraints are multiextremal non-differentiable Lipschitz functions (with unknown Lipschitz constants) and the feasible region is a finite collection of robust…
We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…
This paper introduces a new method for discretizing and solving integral equation formulations of Maxwell's equations which achieves spectral accuracy for smooth surfaces. The approach is based on a hybrid Nystr\"om-collocation method using…
We present a Chebyshev collocation method for linear ODE and DDE problems. We first give a posteriori estimates for the accuracy of the approximate solution of a scalar ODE initial value problem. Examples of the success of the estimate are…
The capacitated p-center problem requires to select p facilities from a set of candidates to service a number of customers, subject to facility capacity constraints, with the aim of minimizing the maximum distance between a customer and its…
A large number of problems in optimization, machine learning, signal processing can be effectively addressed by suitable semidefinite programming (SDP) relaxations. Unfortunately, generic SDP solvers hardly scale beyond instances with a few…
The Alternating Minimization Algorithm (AMA) has been proposed by Tseng to solve convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be…
The geometrical features of the (non-convex) loss landscape of neural network models are crucial in ensuring successful optimization and, most importantly, the capability to generalize well. While minimizers' flatness consistently…
This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations…
We consider the problem of placing n small balls of given radius in a certain domain subject to a force f in order to minimize the compliance of the configuration. Then we let n tend to infinity and look at the asymptotics of the…
The task of finding the smallest energy needed to bring a solid to its onset of mechanical instability arises in many problems in materials science, from the determination of the elasticity limit to the consistent assignment of free…
We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents…
The main challenge of nonconvex optimization is to find a global optimum, or at least to avoid ``bad'' local minima and meaningless stationary points. We study here the extent to which algorithms, as opposed to optimization models and…
We study Facility Location with Matching, a Facility Location problem where, given additional information about which pair of clients is compatible to be matched, we need to match as many clients as possible and assign each matched client…
The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the groups of variables is high-dimensional, and the other is…
The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup…