Related papers: Optimal sets for a class of minimization problems …
This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform problem (MP) into a scalar convex polynomial optimization…
In this paper we present a general convex optimization approach for solving high-dimensional multiple response tensor regression problems under low-dimensional structural assumptions. We consider using convex and weakly decomposable…
The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the…
Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…
We study the planar least gradient problem with respect to an anisotropic norm $\phi$ for continuous boundary data. We prove existence of minimizers for strictly convex domains $\Omega$. Furthermore, we inspect the issue of uniqueness and…
This work considers two popular minimization problems: (i) the minimization of a general convex function $f(\mathbf{X})$ with the domain being positive semi-definite matrices; (ii) the minimization of a general convex function…
We consider the problem of minimizing a convex function over a convex set given access only to an evaluation oracle for the function and a membership oracle for the set. We give a simple algorithm which solves this problem with…
To every nearly convex optimization problem, that is a minimization problem with a nearly convex objective function and a nearly convex constraint set, we associate a uniquely defined convex optimization problem with a lower semicontinuous…
In this paper, we propose two algorithms for solving convex optimization problems with linear ascending constraints. When the objective function is separable, we propose a dual method which terminates in a finite number of iterations. In…
Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the classes of convex functions, strictly quasiconvex functions and…
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
This paper is concerned with the regularity of shape optimizers of a class of isoperimetric problems under convexity constraint. We prove that minimizers of the sum of the perimeter and a perturbative term, among convex shapes, are C…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
We study existence and structure of solutions to the Dirichlet and Neumann boundary problems associated with minimizers of the functional $I(u)=\int_{\Omega} (\phi(x, D u + F)+Hu) \, dx$, where $\phi (x, \xi)$, among other properties, is…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
We present a method for finding lower bounds on the global infima of integral variational problems, wherein $\int_\Omega f(x,u(x),\nabla u(x)){\rm d}x$ is minimized over functions $u\colon\Omega\subset\mathbb{R}^n\to\mathbb{R}^m$ satisfying…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
We prove that if the given compact set $K$ is convex then a minimizer of the functional $$ I(v)=\int_{B_R} |\nabla v|^p dx+\text{Per}(\{v>0\}),\,1<p<\infty, $$ over the set $\{v\in H^1_0(B_R)|\,\, v\equiv 1\,\,\text{on}\,\, K\subset B_R\}$…
This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…
We give necessary and sufficient conditions for minimality of generalized minimizers for linear-growth functionals of the form \[ \mathcal F[u] := \int_\Omega f(x,u(x)) \, \text{d}x, \qquad u:\Omega \subset \mathbb R^N\to \mathbb R^d, \]…