相关论文: A Counterexample and Fix to a Minimum Distance Dua…

Triality theory is proved for a general unconstrained global optimization problem. The method adopted is simple but mathematically rigorous. Results show that if the primal problem and its canonical dual have the same dimension, the…

In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…

In this work we study a special minimax problem where there are linear constraints that couple both the minimization and maximization decision variables. The problem is a generalization of the traditional saddle point problem (which does…

We prove sufficient and necessary conditions ensuring zero duality gap for Lagrangian duality in some classes of nonconvex optimization problems. To this aim, we use the $\Phi$-convexity theory and minimax theorems for $\Phi$-convex…

For Banach spaces $X,Y,$ we consider a distance problem in the space of bounded linear operators $\mathcal{L}(X,Y).$ Motivated by a recent paper \cite{RAO21}, we obtain sufficient conditions so that for a compact operator…

Methods that align distributions by minimizing an adversarial distance between them have recently achieved impressive results. However, these approaches are difficult to optimize with gradient descent and they often do not converge well…

We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no…

This article develops a duality principle for a class of optimization problems in $\mathbb{R}^n$. The results are obtained based on standard tools of convex analysis and on a well known result of Toland for D.C. optimization. Global…

We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven bounds on the duality gap, and an efficient primalization…

We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…

The idea of minimum distance, familiar from R <-> 1/R duality when the string target space is a circle, is analyzed for less trivial geometries. The particular geometry studied is that of a blown-up quotient singularity within a Calabi-Yau…

In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…

A problem of the erroneous duality gap caused by the presence of symmetries is solved in this paper utilizing point group theory. The optimization problems are first divided into two classes based on their predisposition to suffer from this…

Let $k$ be a local field with valuation ring $O_k$ and residue field $\overline{k}$. We extend Hahn--Banach theorem for the class of seminormed $k$-vector spaces to several classes of locally convex spaces and subspaces over $k$, $O_k$, and…

This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003. Results…

Existence of solutions to doubly nonlinear equations in reflexive Banach spaces is established by resorting to a global-in-time variational approach inspired by De Giorgi's principle, which characterizes the associated flows as…

Learning methods in Banach spaces are often formulated as regularization problems which minimize the sum of a data fidelity term in a Banach norm and a regularization term in another Banach norm. Due to the infinite dimensional nature of…

Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…

It is folklore that the sum of two $M$-ideals (semi $M$-ideals) is also an $M$-ideal (a semi $M$-ideal). Numerous authors have attempted to investigate such properties of subspaces. This article explores two important facets of…

We prove that, any problem of minimization of proper lower semicontinuous function defined on a normal Hausdorff space, is canonically equivalent to a problem of minimization of a proper weak * lower semicontinuous convex function defined…