Related papers: An Optimal Order Error Analysis of the One-Dimensi…
We consider the leading order quasicontinuum limits of a one-dimensional granular medium governed by the Hertz contact law under precompression. The approximate model which is derived in this limit is justified by establishing asymptotic…
The rigorous convergence analysis of adaptive finite element methods for regularized variational models of quasi-static brittle fracture in strain-limiting elastic solids is presented. This work introduces two novel adaptive mesh refinement…
The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning (RL), and often an efficient approach to solving (or approximating the solution to) complex optimal control…
We prove the quasi-optimal convergence of a standard adaptive finite element method (AFEM) for nonlinear elliptic second-order equations of monotone type. The adaptive algorithm is based on residual-type a posteriori error estimators and…
Finite element approximation to a decoupled formulation for the quad--curl problem is studied in this paper. The difficulty of constructing elements with certain conformity to the quad--curl problems has been greatly reduced. For convex…
We establish the optimal nonergodic sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. First, the optimal bound is formulated by the performance estimation framework, resulting in an infinite…
A space-discretization for the elastic flow of inextensible curves is devised and quasi-optimal convergence of the corresponding semi-discrete problem is proved for a suitable discretization of the nonlinear inextensibility constraint.…
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenness, we prove inapproximability of $14/15+\epsilon$ and…
Nondominated sorting is a discrete process that sorts points in Euclidean space according to the coordinatewise partial order, and is used to rank feasible solutions to multiobjective optimization problems. It was previously shown that…
We establish local existence and a quasi-optimal error estimate for piecewise cubic minimizers to the bending energy under a discretized inextensibility constraint. In previous research a discretization is used where the inextensibility…
Understanding the growth of quasicrystals poses a challenging problem, not the least because the quasiperiodic order present in idealized mathematical models of quasicrystals prohibit simple local growth algorithms. This can only be…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…
We perform calculations relating the order parameter symmetry of organic quasi-one-dimensional superconductors to the bulk quasiparticle density of states and the bulk uniform spin susceptibility tensor at finite temperatures. Current…
Frequency-limited model order reduction aims to approximate a high-order model with a reduced-order model that maintains high fidelity within a specific frequency range. Beyond this range, a decrease in accuracy is acceptable due to the…
We investigate two examples of node-based cluster summation rules that have been proposed for the quasicontinuum method: a force-based approach (Knap & Ortiz, J. Mech. Phys. Solids 49, 2001), and an energy-based approach which is a…
We give an analysis of a continuation algorithm for the numerical solution of the force-based quasicontinuum equations. The approximate solution of the force-based quasicontinuum equations is computed by an iterative method using an…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
The aim of this paper is to present a streamlined and fully three-dimensional version of the quasicontinuum (QC) theory of Tadmor et al. and to analyze its accuracy and convergence characteristics. Specifically, we assess the effect of the…
The filtering-clustering models, including trend filtering and convex clustering, have become an important source of ideas and modeling tools in machine learning and related fields. The statistical guarantee of optimal solutions in these…
Stochastic approximation is a foundation for many algorithms found in machine learning and optimization. It is in general slow to converge: the mean square error vanishes as $O(n^{-1})$. A deterministic counterpart known as quasi-stochastic…