Related papers: G\^ateaux semiderivative approach applied to shape…
Local solutions for variational and quasi-variational inequalities are usually the best type of solutions that could practically be obtained when in case of lack of convexity or else when available numerical techniques are too limited for…
Minimizing the so-called "Dirichlet energy" with respect to the domain under a volume constraint is a standard problem in shape optimization which is now well understood. This article is devoted to a prototypal non-linear version of the…
We study the optimal control of a rate-independent system that is driven by a convex, quadratic energy. Since the associated solution mapping is non-smooth, the analysis of such control problems is challenging. In order to derive optimality…
In this paper, we couple regularization techniques with the adaptive $hp$-version of the boundary element method ($hp$-BEM) for the efficient numerical solution of linear elastic problems with nonmonotone contact boundary conditions. As a…
Most of the optimal guidance problems can be formulated as nonconvex optimization problems, which can be solved indirectly by relaxation, convexification, or linearization. Although these methods are guaranteed to converge to the global…
We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and…
This paper studies formulations of second-order elliptic partial differential equations in nondivergence form on convex domains as equivalent variational problems. The first formulation is that of Smears \& S\"uli [SIAM J.\ Numer.\ Anal.\…
This paper introduces a new extension of Riemannian elastic curve matching to a general class of geometric structures, which we call (weighted) shape graphs, that allows for shape registration with partial matching constraints and…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
We propose a proximal variable smoothing algorithm for nonsmooth optimization problem with sum of three functions involving weakly convex composite function. The proposed algorithm is designed as a time-varying forward-backward splitting…
In this paper, we consider a new kind of evolution multivalued quasi-variational inequalities with feedback effect and a nonlinear bifunction which contain several (evolution) quasi-variational/hemivariational inequalities as special cases.…
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…
An optimal control problem for the linear wave equation with control cost chosen as the BV semi-norm in time is analyzed. This formulation enhances piecewise constant optimal controls and penalizes the number of jumps. Existence of optimal…
This paper describes a class of shape optimization problems for optical metamaterials comprised of periodic microscale inclusions composed of a dielectric, low-dimensional material suspended in a non-magnetic bulk dielectric. The shape…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…
This paper provides second-order optimality conditions for optimization problems with generalized equation constraints (GEPs), a framework that encompasses several important and challenging models in mathematical programming, including…
The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of moments. This paper studies the discrete moment problems with…
In this paper we investigate a system of coupled inequalities consisting of a variational-hemivariational inequality and a quasi-hemivariational inequality on Banach spaces. The approach is topological, and a wide variety of existence…
In the present paper, several types of efficiency conditions are established for vector optimization problems with cone constraints affected by uncertainty, but with no information of stochastic nature about the uncertain data. Following a…