相关论文: Algebraic solution of minimax single-facility cons…

Approximating adequate number of clusters in multidimensional data is an open area of research, given a level of compromise made on the quality of acceptable results. The manuscript addresses the issue by formulating a transductive…

The analysis of linear ill-posed problems often is carried out in function spaces using tools from functional analysis. However, the numerical solution of these problems typically is computed by first discretizing the problem and then…

The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…

In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones,…

Perturbation theory is a powerful tool for studying large-scale structure formation in the universe and calculating observables such as the power spectrum or bispectrum. However, beyond linear order, typically this is done by assuming a…

We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…

We consider resolvent splitting algorithms for finding a zero of the sum of finitely many maximally monotone operators. The standard approach to solving this type of problem involves reformulating as a two-operator problem in the…

The solution of sequences of shifted linear systems is a classic problem in numerical linear algebra, and a variety of efficient methods have been proposed over the years. Nevertheless, there still exist challenging scenarios witnessing a…

We study mechanisms for the facility location problem augmented with predictions of the optimal facility location. We demonstrate that an egalitarian viewpoint which considers both the maximum distance of any agent from the facility and the…

For three decades, carrier-phase observations have been used to obtain the most accurate location estimates using global navigation satellite systems (GNSS). These estimates are computed by minimizing a nonlinear mixed-integer least-squares…

We address optimal control problems on the space of measures for an objective containing a smooth functional and an optimal transport regularization. That is, the quadratic Monge-Kantorovich distance between a given prior measure and the…

We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…

We establish that solving an optimal transportation problem in which the source and target densities are defined on manifolds with different dimensions, is equivalent to solving a new nonlocal analog of the Monge-Amp\`ere equation,…

In this paper, we study a nonsmooth/nonconvex multiobjective optimization problem with uncertain constraints in arbitrary Asplund spaces. We first provide necessary optimality condition in a fuzzy form for approximate weakly robust…

In topology optimization, the design parameter with no contribution to the objective function vanishes. This causes the stiffness matrix to become singular. We show that a local optimal solution is obtained by Conjugate Residual Method and…

The Lane-Emden equation has been used to model several phenomenas in theoretical physics, mathematical physics and astrophysics such as the theory of stellar structure. This study is an attempt to utilize the collocation method with the…

In this work, we consider a method of searching of the direction of a wireless network development (the places of new access points or base stations etc.) optimized with criteria of coverage of important territories and minimum cost of…

We consider the nonconvex minimization problem, with quartic objective function, that arises in the exact recovery of a configuration matrix $P\in \R^{nd}$ of $n$ points when a Euclidean distance matrix, \EDMp, is given with embedding…

Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their reverse-convexity. We develop new algorithms for tightening…

In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…