Related papers: Orbital minimization method with $\ell^1$ regulari…
Recently, an approximate theoretical framework was introduced, called local reduced density matrix functional theory (local-RDMFT), where functionals of the one-body reduced density matrix (1-RDM) are minimized under the additional…
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the…
In this paper, we consider nonconvex optimization problems with nonlinear equality constraints. We assume that the objective function and the functional constraints are locally smooth. To solve this problem, we introduce a linearized…
We consider the general nonlinear optimization problem where the objective function has an additional term defined by the $ \ell_0 $-quasi-norm in order to promote sparsity of a solution. This problem is highly difficult due to its…
We show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order $1$),…
Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…
We study high-dimensional estimators with the trimmed $\ell_1$ penalty, which leaves the $h$ largest parameter entries penalty-free. While optimization techniques for this nonconvex penalty have been studied, the statistical properties have…
The constrained $\ell_0$ regularization plays an important role in sparse reconstruction. A widely used approach for solving this problem is the penalty method, of which the least square penalty problem is a special case. However, the…
We study $H^1$ versus $C^1$ local minimizers for functionals defined on spaces of symmetric functions, namely functions that are invariant by the action of some subgroups of $\mathcal{O}(N)$. These functionals, in many cases, are associated…
In this paper, we establish an $\varepsilon$-regularity theorem for minimizers of an Alt-Phillips type functional subject to constraint maps. We prove that under sufficiently small energy, the minimizers exhibit regularity, and hence…
We present a new algorithm and the corresponding convergence analysis for the regularization of linear inverse problems with sparsity constraints, applied to a new generalized sparsity promoting functional. The algorithm is based on the…
The $\ell_{1\text{-}2}$ regularization method has a strong sparsity promoting capability in approaching sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. This…
This paper considers solving the unconstrained $\ell_q$-norm ($0\leq q<1$) regularized least squares ($\ell_q$-LS) problem for recovering sparse signals in compressive sensing. We propose two highly efficient first-order algorithms via…
In this paper we provide improved running times and oracle complexities for approximately minimizing a submodular function. Our main result is a randomized algorithm, which given any submodular function defined on $n$-elements with range…
In this paper we consider the volume-constrained minimization of a variant of the Ohta-Kawasaki functional with an anisotropic surface energy replacing the standard perimeter. Following and suitably adapting the second variation approach…
We consider a shape optimization problem for a hybrid energy combining local confinement and nonlocal Coulomb repulsion. Specifically, for any open set $\Omega \subseteq \mathbb{R}^3$ of prescribed volume, we consider the ground state…
We consider an $\ell_0$-minimization problem where $f(x) + \gamma \|x\|_0$ is minimized over a polyhedral set and the $\ell_0$-norm regularizer implicitly emphasizes sparsity of the solution. Such a setting captures a range of problems in…
Many electronic structure methods rely on the minimization of the energy of the system with respect to the one-body reduced density matrix (1-RDM). To formulate a minimization algorithm, the 1-RDM is often expressed in terms of its…
The rank minimization problem is to find the lowest-rank matrix in a given set. Nuclear norm minimization has been proposed as an convex relaxation of rank minimization. Recht, Fazel, and Parrilo have shown that nuclear norm minimization…
We consider the problem of global optimization of an unknown non-convex smooth function with zeroth-order feedback. In this setup, an algorithm is allowed to adaptively query the underlying function at different locations and receives noisy…