相关论文: On Novel Fixed-Point-Type Iterations with Structur…

In the last few decades, numerical simulation for nonlinear oscillators has received a great deal of attention, and many researchers have been concerned with the design and analysis of numerical methods for solving oscillatory problems. In…

We present PANOC, a new algorithm for solving optimal control problems arising in nonlinear model predictive control (NMPC). A usual approach to this type of problems is sequential quadratic programming (SQP), which requires the solution of…

Quadratic discriminant analysis (QDA) is a widely used method for classification problems, particularly preferable over Linear Discriminant Analysis (LDA) for heterogeneous data. However, QDA loses its effectiveness in high-dimensional…

Principal component analysis (PCA) is an essential algorithm for dimensionality reduction in many data science domains. We address the problem of performing a federated PCA on private data distributed among multiple data providers while…

This paper proposes a differentiable linear quadratic Model Predictive Control (MPC) framework for safe imitation learning. The infinite-horizon cost is enforced using a terminal cost function obtained from the discrete-time algebraic…

Topological Data Analysis (TDA) is a rapidly growing field, which studies methods for learning underlying topological structures present in complex data representations. TDA methods have found recent success in extracting useful geometric…

This paper focuses on indefinite stochastic mean-field linear-quadratic (MF-LQ, for short) optimal control problems, which allow the weighting matrices for state and control in the cost functional to be indefinite. The solvability of…

The stochastic simulation algorithm (SSA) is widely used to perform exact forward simulation of discrete stochastic processes in biology. However, the computational cost, driven by sequential event-by-event sampling across large ensembles,…

While modern text-to-image models excel at prompt-based generation, they often lack the fine-grained control necessary for specific user requirements like spatial layouts or subject appearances. Multi-condition control addresses this, yet…

In this article, the focus is mainly on gaining the optimal control for the unstable power system models and stabilizing them through the Riccati-based feedback stabilization process with sparsity-preserving techniques. We are to find the…

The main contribution of this work is to construct and analyze stable and high order schemes to efficiently solve the two-dimensional time Caputo-Fabrizio fractional diffusion equation. Based on a third-order finite difference method in…

This paper addresses the stabilization of dynamical systems in the infinite horizon optimal control setting using nonlinear feedback control based on State-Dependent Riccati Equations (SDREs). While effective, the practical implementation…

Formation control problems can be expressed as linear quadratic discrete-time games (LQDTG) for which Nash equilibrium solutions are sought. However, solving such problems requires solving coupled Riccati equations, which cannot be done in…

Graph matching, typically formulated as a Quadratic Assignment Problem (QAP), seeks to establish node correspondences between two graphs. To address the NP-hardness of QAP, some existing methods adopt projection-based relaxations that embed…

We provide a note on continuous-stage Runge-Kutta methods (csRK) for solving initial value problems of first-order ordinary differential equations. Such methods, as an interesting and creative extension of traditional Runge-Kutta (RK)…

The discrete-dipole approximation (DDA) is a flexible technique for computing scattering and absorption by targets of arbitrary geometry. In this paper we perform systematic study of various non-stationary iterative (conjugate gradient)…

We propose a unified iterative framework for the solution of frictionless mechanical contact problems, which relies exclusively on the solution of standard stiffness systems. The framework is built upon a two-step fixed-point algorithm:…

We propose an efficient approach to semidefinite spectral clustering (SSC), which addresses the Frobenius normalization with the positive semidefinite (p.s.d.) constraint for spectral clustering. Compared with the original Frobenius norm…

Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause…

Iterative phase retrieval methods based on the Gerchberg-Saxton (GS) or Fienup algorithm require a large number of iterations to converge to a meaningful solution. For complex-valued or phase objects, these approaches also suffer from…