Related papers: Revisiting second-order optimality conditions for …
Let $M$ be an $n$-dimensional Lagrangian submanifold of a complex space form. We prove a pointwise inequality $$\delta(n_1,\ldots,n_k) \leq a(n,k,n_1,\ldots,n_k) \|H\|^2 + b(n,k,n_1,\ldots,n_k)c,$$ with on the left hand side any…
We consider a general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set.…
In this paper, we are interested in shape optimization problems involving the ge ometry (normal, curvatures) of the surfaces. We consider a class of hypersurface s in $\mathbb{R}^{n}$ satisfying a uniform ball condition and we prove the…
In this paper, we consider a nonconvex optimization problem with nonlinear equality constraints. We assume that both, the objective function and the functional constraints are locally smooth. For solving this problem, we propose a…
In this paper, we consider the well-known following shape optimization problem: $$\lambda_2(\Omega^*)=\min_{\stackrel{|\Omega|=V_0} {\Omega\textrm{ convex}}} \lambda_2(\Omega),$$ where $\lambda_2(\Om)$ denotes the second eigenvalue of the…
In this paper we consider three minimization problems, namely quadratic, $\rho$-convex and quadratic fractional programing problems. The quadratic problem is considered with quadratic inequality constraints with bounded continuous and…
We investigate the fundamental optimization question of minimizing a target function $f$, whose gradients are expensive to compute or have limited availability, given access to some auxiliary side function $h$ whose gradients are cheap or…
We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…
A broad class of optimization problems can be cast in composite form, that is, considering the minimization of the composition of a lower semicontinuous function with a differentiable mapping. This paper investigates the versatile template…
As the problem of minimizing functionals on the Wasserstein space encompasses many applications in machine learning, different optimization algorithms on $\mathbb{R}^d$ have received their counterpart analog on the Wasserstein space. We…
We associate with each convex optimization problem posed on some locally convex space with an infinite index set T, and a given non-empty family H formed by finite subsets of T, a suitable Lagrangian-Haar dual problem. We provide reverse…
In this paper, we study a class of convex composite optimization problems. We begin by characterizing the equivalence between the primal/dual strong second-order sufficient condition and the dual/primal nondegeneracy condition. Building on…
Verifying the Second-Order Sufficient Condition (SOSC), thus ensuring a stationary point locally minimizes a given objective function (subject to certain constraints), is an essential component of non-convex computational optimization and…
In the contest of optimal control problems, regularity results for optima are known when addressing fiber-strictly convex Lagrangian. For infinite time horizons, or for settings with infinite dimensional dynamics, the equivalence between…
It has been shown recently that optimal control problems with the dynamical constraint given by a second order system admit a regular Lagrangian formulation. This implies that the optimality conditions can be obtained in a new form based on…
Local convergence analysis of the augmented Lagrangian method (ALM) is established for a large class of composite optimization problems with nonunique Lagrange multipliers under a second-order sufficient condition. We present a new…
In this paper convex optimization techniques are employed for convex optimization problems in infinite dimensional Hilbert spaces. A first order optimality condition is given. Let $f : \mathbb{R}^{n}\rightarrow \mathbb{R}$ and let $x\in…
Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…
We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that…
We consider the minimization of a convex objective function subject to the set of minima of another convex function, under the assumption that both functions are twice continuously differentiable. We approach this optimization problem from…