Related papers: Finitely Convergent Iterative Methods with Overrel…
Sparsity constrained minimization captures a wide spectrum of applications in both machine learning and signal processing. This class of problems is difficult to solve since it is NP-hard and existing solutions are primarily based on…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
Force-based multiphysics coupling methods have become popular since they provide a simple and efficient coupling mechanism, avoiding the difficulties in formulating and implementing a consistent coupling energy. They are also the only known…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…
In this paper, we propose a multilevel stochastic framework for the solution of nonconvex unconstrained optimization problems. The proposed approach uses random regularized first-order models that exploit an available hierarchical…
In this paper, we study the stability and convergence of a decoupled and linearized mixed finite element method (FEM) for incompressible miscible displacement in a porous media whose permeability and porosity are discontinuous across some…
In this article we develop convergence theory for a class of goal-oriented adaptive finite element algorithms for second order nonsymmetric linear elliptic equations. In particular, we establish contraction results for a method of this type…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
We prove the convergence of an adaptive mixed finite element method (AMFEM) for (nonsymmetric) convection-diffusion-reaction equations. The convergence result holds from the cases where convection or reaction is not present to convection-or…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
Recent advances in cutting-plane strategies applied to robust optimization problems show that they are competitive with respect to problem reformulations and interior-point algorithms. However, although its application with polyhedral…
In this paper we address the speed planning problem for a vehicle along a predefined path. A weighted average of two (conflicting) terms, energy consumption and travel time, is minimized. After deriving a non-convex mathematical model of…
For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate…
We study the convergence of a family of numerical integration methods where the numerical integral is formulated as a finite matrix approximation to a multiplication operator. For bounded functions, the convergence has already been…
In this paper, we consider the nonsmooth convex optimization problems over the fixed point constraint sets of firmly nonexpansive operators. To find an optimal solution of the problem, we present an iterative method based on the hybrid…
This paper investigates simple bilevel optimization problems where we minimize an upper-level objective over the optimal solution set of a convex lower-level objective. Existing methods for such problems either only guarantee asymptotic…
This paper studies noisy low-rank matrix completion: given partial and noisy entries of a large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently. Arguably one of the most popular paradigms to tackle…
Motivated by robust matrix recovery problems such as Robust Principal Component Analysis, we consider a general optimization problem of minimizing a smooth and strongly convex loss function applied to the sum of two blocks of variables,…
In this paper, we present a unified analysis of both convergence and optimality of adaptive mixed finite element methods for a class of problems when the finite element spaces and corresponding a posteriori error estimates under…