Cover Image

Gradient flow for finding E-optimal designs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shi, Jieling, Toh, Kim-Chuan, Tong, Xin T., Wong, Weng Kee
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Computation 62K05, 49Q22, 90C25, 65K10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
by: Chen, Liang, et al.
Published: (2025)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
by: Burns, Matthew X., et al.
Published: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Global optimality conditions for sensor placement, with extensions to binary low-rank A-optimal designs
by: Aarset, Christian
Published: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Computing Optimal Trajectories for Optimal Transport in Nonuniform Environments
by: Dieci, Luca, et al.
Published: (2025)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

Optimization of continuous-flow over traffic networks with fundamental diagram constraints
by: Dong, Anqi, et al.
Published: (2025)

An Efficient Augmented Lagrangian Method for Dynamic Optimal Transport on Surfaces Based on Second-Order Cone Programming
by: Chen, Liang, et al.
Published: (2025)

FEM-based A-optimal sensor placement for heat source inversion from final time measurement
by: Aarset, Christian, et al.
Published: (2025)

An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)

Curvature-Aware Derivative-Free Optimization
by: Kim, Bumsu, et al.
Published: (2021)

Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)

Inexact Adjoint Gradients and Directional Tolerances for Full-Potential Airfoil Optimization
by: Macedo, Humberto Gimenes, et al.
Published: (2026)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Stochastic homogenisation of nonlinear minimum-cost flow problems
by: Gladbach, Peter, et al.
Published: (2024)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
by: Ran, Yifan
Published: (2023)

Preconditioned primal-dual dynamics in convex optimization: non-ergodic convergence rates
by: Apidopoulos, Vassilis, et al.
Published: (2025)

Bregman proximal gradient method for linear optimization under entropic constraints
by: Briceño-Arias, Luis M., et al.
Published: (2025)

Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
by: Boţ, Radu Ioan, et al.
Published: (2024)

A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization
by: Pei, Yonggang, et al.
Published: (2024)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\ge 3$
by: Zhang, Lixing
Published: (2026)

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

The Intrinsic Riemannian Proximal Gradient Method for Convex Optimization
by: Bergmann, Ronny, et al.
Published: (2025)

Towards optimal sensor placement for inverse problems in spaces of measures
by: Huynh, Phuoc-Truong, et al.
Published: (2023)

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, et al.
Published: (2025)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

Sampleability transport, nonlinear regularization, and the porous medium flow
by: Lam, Hy P. G.
Published: (2026)

On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent
by: Laumont, Rémi, et al.
Published: (2022)