Cover Image

Convex Analysis of Relaxation Dynamics in Chemical Reaction Networks and Generalized Gradient Flows

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sugie, Keisuke, Loutchko, Dimitri, Kobayashi, Tetsuya J.
Format:	Preprint
Published:	2026
Subjects:	Molecular Networks Statistical Mechanics Differential Geometry Optimization and Control Chemical Physics 53B12, 80A30, 90C25, 90C90, 92C45
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cramer-Rao bound and absolute sensitivity in chemical reaction networks
by: Loutchko, Dimitri, et al.
Published: (2024)

Information geometry of chemical reaction networks: Cramer-Rao bound and absolute sensitivity revisited
by: Loutchko, Dimitri, et al.
Published: (2025)

Subdifferential theory and the Fenchel conjugate via Busemann functions on Hadamard manifolds
by: Bento, G. C., et al.
Published: (2026)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
by: Azuma, Godai, et al.
Published: (2025)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

Gradient descent for unbounded convex functions on Hadamard manifolds and its applications to scaling problems
by: Hirai, Hiroshi, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Generalized gradient flows in Hadamard manifolds and convex optimization on entanglement polytopes
by: Hirai, Hiroshi
Published: (2025)

A scaling characterization of nc-rank via unbounded gradient flow
by: Hirai, Hiroshi
Published: (2025)

Riemannian Gradient Method with Momentum
by: Leggio, Filippo, et al.
Published: (2026)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

Adaptive Inertial Method
by: Long, Han, et al.
Published: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control
by: Blanco, Víctor, et al.
Published: (2026)

MOCVXPY: a CVXPY extension for multiobjective optimization
by: Salomon, Ludovic, et al.
Published: (2025)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
by: García-Castaño, Fernando, et al.
Published: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
by: Ou, Hongjia, et al.
Published: (2024)

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)

Constraint Qualification for Generic Parameter Families of Constraints in Optimization
by: Hamada, Naoki, et al.
Published: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Riemannian Interior Point Methods for Constrained Optimization on Manifolds
by: Lai, Zhijian, et al.
Published: (2022)

Quasi-Newton methods for minimizing a quadratic function subject to uncertainty
by: Peng, Shen, et al.
Published: (2021)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
by: Diouane, Youssef, et al.
Published: (2024)