Related papers: Global solutions of approximation problems in Krei…
Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need to use heuristics to solve these problems on large instances,…
The article deals with iterative methods of solving linear operator equations $x = Bx + f$ and $Ax = f$ with self-adjoint operators in Hilbert space $X$ in critical case when $\rho(B) = 1$ and $0 \in {\rm Sp}\, A$. The main results are…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
Two new hybrid algorithms are proposed for large-scale linear discrete ill-posed problems in general-form regularization. They are both based on Krylov subspace inner-outer iterative algorithms. At each iteration, they need to solve a…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
Scaling problems have a rich and diverse history, and thereby have found numerous applications in several fields of science and engineering. For instance, the matrix scaling problem has had applications ranging from theoretical computer…
We study generalized solutions of an evolutionary equation related to a densely defined skew-symmetric operator in a real Hilbert space. We establish existence of a contractive semigroup, which provides generalized solutions, and find…
We apply non-linear WKB analysis to the study of the string equation. Even though the solutions obtained with this method are not exact, they approximate extremely well the true solutions, as we explicitly show using numerical simulations.…
In the theory of tractability of multivariate problems one usually studies problems with finite smoothness. Then we want to know which $s$-variate problems can be approximated to within $\varepsilon$ by using, say, polynomially many in $s$…
The problem of monotone smoothing splines with bounds is formulated as a constrained minimization problem of the calculus of variations. Existence and uniqueness of solutions of this problem is proved, as well as the equivalence of it to a…
Separable nonlinear least squares (SNLS)problem is a special class of nonlinear least squares (NLS)problems, whose objective function is a mixture of linear and nonlinear functions. It has many applications in many different areas,…
This paper deals with approximate solutions of a nonsmooth semi-infinite programming with multiple interval-valued objective functions. We first introduce four types of approximate quasi Pareto solutions of the considered problem by…
Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…
In this work we collect and compare to each other many different numerical methods for regularized regression problem and for the problem of projection on a hyperplane. Such problems arise, for example, as a subproblem of demand matrix…
Procrustes problems are matrix approximation problems searching for a~transformation of the given dataset to fit another dataset. They find applications in numerous areas, such as factor and multivariate analysis, computer vision,…
Inspired in the theorem of Krein-Milamn, we investigate the existence of extreme points in compact convex subsets of asymmetric normed spaces. We focus our attention in the finite dimensional case, giving a geometric description of all…
We study minimal graphs in the homogeneous Riemannian 3-manifold $\widetilde{PSL_2(\mathbb{R})}$ and we give examples of invariant surfaces. We derive a gradient estimate for solutions of the minimal surface equation in this space and…
We give local conditions at the infinite places of a number field K ensuring that the intersection of n quadrics in projective N-space over K, N >> n, satisfies weak approximation.