Related papers: A Simple Proof of Nehari's Theorem Based on Dualit…

In this paper we introduce two conceptual algorithms for minimising abstract convex functions. Both algorithms rely on solving a proximal-type subproblem with an abstract Bregman distance based proximal term. We prove their convergence when…

In this work, optimality conditions and classical results from duality theory are derived for continuous-time linear optimization problems with inequality constraints. The optimality conditions are given in the Karush-Kuhn-Tucker form. Weak…

In this article we develop a duality principle and concerning computational method for a structural optimization problem in elasticity. We consider the problem of finding the optimal topology for an elastic solid which minimizes its…

This is an expository paper describing how duality theory for Hessian manifolds provides a natural setting for optimal transport. We explain how this can be used to solve Monge-Amp\`ere equations and survey recent results along these lines…

The main purpose of this research note is to show that the triality theory can always be used to identify both global minimizer and the biggest local maximizer in global optimization. An open problem left on the double-min duality is solved…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Convex integration and the holonomic approximation theorem are two well-known pillars of flexibility in differential topology and geometry. They may each seem to have their own flavor and scope. The goal of this paper is to bring some new…

Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…

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…

This paper is intended to give a characterization of the optimality case in Nash's inequality, based on methods of nonlinear analysis for elliptic equations and techniques of the calculus of variations. By embedding the problem into a…

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…

In this paper, the $\mathcal{H}_{2}$ optimal approximation of a $n_{y}\times{n_{u}}$ transfer function $\mathbf{G}(s)$ by a finite dimensional system $\hat{\mathbf{H}}_{d}(s)$ including input/output delays, is addressed. The underlying…

Recently, Yamanaka and Yamashita proposed the so-called positively homogeneous optimization problem, which includes many important problems, such as the absolute-value and the gauge optimizations. They presented a closed form of the dual…

This paper focuses on the minimization of a sum of a twice continuously differentiable function $f$ and a nonsmooth convex function. An inexact regularized proximal Newton method is proposed by an approximation to the Hessian of $f$…

Z. Nehari developed a general technique for obtaining inequalities for conformal maps and domain functions from contour integrals and the Dirichlet principle. Given a harmonic function with singularity on a domain $R$, it associates a…

Caffarelli's contraction theorem and the analogous Laplacian result in [arXiv:2411.12109, arXiv:2501.11382] are two examples of how log-Hessian bounds on probability densities yield estimates on the derivative of the corresponding Brenier…

By theorems of Ferguson and Lacey (d=2) and Lacey and Terwilleger (d>2), Nehari's theorem is known to hold on the polydisc D^d for d>1, i.e., if H_\psi is a bounded Hankel form on H^2(D^d) with analytic symbol \psi, then there is a function…

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…

We give a simple proof of Strassen's theorem on stochastic dominance using linear programming duality, without requiring measure-theoretic arguments. The result extends to generalized inequalities using conic optimization duality and…

In this paper, we introduce new properties of the relative interior calculus for nearly convex sets, functions, and set-valued mappings. These properties are important for the development of duality theory in optimization. Then we…