相关论文: Modified Polyhedral Method for Elicitation of Shap…

We consider a method of pairwise variations for smooth optimization problems, which involve polyhedral constraints. It consists in making steps with respect to the difference of two selected extreme points of the feasible set together with…

Circuit-augmentation algorithms are generalizations of the Simplex method, where in each step one is allowed to move along a fixed set of directions, called circuits, that is a superset of the edges of a polytope. We show that in the…

In this paper, we propose and analyze a multiscale method for a class of quasilinear elliptic problems of nonmonotone type with spatially multiscale coefficient. The numerical approach is inspired by the Localized Orthogonal Decomposition…

Several large-scale machine learning tasks, such as data summarization, can be approached by maximizing functions that satisfy submodularity. These optimization problems often involve complex side constraints, imposed by the underlying…

Methods for controlling large language models (LLMs), including local weight fine-tuning, LoRA-based adaptation, and activation-based interventions, are often studied in isolation, obscuring their connections and making comparison…

In this work, we examine a numerical phase-field fracture framework in which the crack irreversibility constraint is treated with a primal-dual active set method and a linearization is used in the degradation function to enhance the…

A mixed finite element method combining an iso-parametric $Q_2$-$P_1$ element and an iso-parametric $P_2^+$-$P_1$ element is developed for the computation of multiple cavities in incompressible nonlinear elasticity. The method is…

In this paper we propose a {\it discontinuous} plane wave neural network (DPWNN) method with $hp-$refinement for approximately solving Helmholtz equation and time-harmonic Maxwell equations. In this method, we define a quadratic functional…

We study nonparametric estimation of a probability mass function (PMF) on a large discrete support, where the PMF is multi-modal and heavy-tailed. The core idea is to treat the empirical PMF as a signal on a line graph and apply a…

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…

This paper deals with the study of parameter dependence of extensions of Lipschitz mappings from the point of view of continuity. We show that if assuming appropriate curvature bounds for the spaces, the multivalued extension operators that…

This paper proposes two practical implementations of Four-Dimensional Variational (4D-Var) Ensemble Kalman Filter (4D-EnKF) methods for non-linear data assimilation. Our formulations' main idea is to avoid the intrinsic need for adjoint…

We propose a descent subgradient algorithm for minimizing a real function, assumed to be locally Lipschitz, but not necessarily smooth or convex. To find an effective descent direction, the Goldstein subdifferential is approximated through…

We propose a quasi-Newton-type method for nonconvex optimization with Lipschitz continuous gradients and Hessians. The algorithm finds an $\varepsilon$-stationary point within $\tilde{\mathrm{O}}(d^{1/4} \varepsilon^{-13/8})$ gradient…

In this work we propose a simple but effective high order polynomial correction allowing to enhance the consistency of all kind of boundary conditions for the Euler equations (Dirichlet, characteristic far-field and slip-wall), both in 2D…

Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably converge with a linear rate when: i) the feasible set is a…

In [L. Chen and R. Li, Journal of Scientific Computing, Vol. 68, pp. 1172--1197, (2016)], an integrated linear reconstruction was proposed for finite volume methods on unstructured grids. However, the geometric hypothesis of the mesh to…

The effectiveness of dimensionality reduction with quadratic manifolds hinges on the choice of a reduced basis and the associated quadratic correction terms. Existing approaches typically rely on subspaces spanned by the leading principal…

We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many…

In this paper, we develop new continuous and discrete relaxations for nonlinear expressions in an MINLP. In contrast to factorable programming, our techniques utilize the inner-function structure by encapsulating it in a polyhedral set,…