Gradient Transformation Trajectory Following Algorithms for Determining Stationary Min-Max Saddle Points
From MaRDI portal
Publication:5428678
Recommendations
- Gradient transformation trajectory following algorithms for equality-constrained minimization
- scientific article; zbMATH DE number 880288
- Trajectory-following algorithms for min-max optimization problems
- scientific article; zbMATH DE number 4049432
- Generalized gradient method for the determination of (?+?, ?+?)-saddle points
Cited in
(11)- Greatest descent algorithms in unconstrained optimization
- How to trap a gradient flow
- A local minimax method using virtual geometric objects. I. For finding saddles
- A local minimax method using virtual geometric objects. II. For finding equality constrained saddles
- High-index optimization-based shrinking dimer method for finding high-index saddle points
- Error estimate for semi-implicit method of sphere-constrained high-index saddle dynamics
- Optimization-based shrinking dimer method for finding transition states
- Constrained shrinking dimer dynamics for saddle point search with constraints
- Probabilistic error estimate for numerical discretization of high-index saddle dynamics with inaccurate models
- Gradient transformation trajectory following algorithms for equality-constrained minimization
- An implicit gradient-descent procedure for minimax problems
This page was built for publication: Gradient Transformation Trajectory Following Algorithms for Determining Stationary Min-Max Saddle Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428678)