An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations

DOI10.1137/23M1545744zbMath1523.65052arXiv2301.02942MaRDI QIDQ6054283

No author found.

Publication date: 27 September 2023

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.02942

zbMATH Keywords

optimizationstabilityconvergence analysisadaptivescalar auxiliary variablediscrete gradient system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
• Lectures on convex optimization
• Introductory lectures on convex optimization. A basic course.
• Linear, first and second-order, unconditionally energy stable numerical schemes for the phase field model of homopolymer blends
• The scalar auxiliary variable (SAV) approach for gradient flows
• Solving phase retrieval with random initial guess is nearly as good as by spectral initialization
• Improving the accuracy and consistency of the scalar auxiliary variable (SAV) method with relaxation
• Laplacian smoothing gradient descent
• Efficient SAV approach for imaginary time gradient flows with applications to one- and multi-component Bose-Einstein condensates
• A revisit of the energy quadratization method with a relaxation technique
• Minimization of functions having Lipschitz continuous first partial derivatives
• A generalized SAV approach with relaxation for dissipative systems
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• A Steepest-Ascent Method for Solving Optimum Programming Problems
• Large-Scale Convex Optimization
• Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size
• A New Class of Efficient and Robust Energy Stable Schemes for Gradient Flows
• Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
• Convergence Conditions for Ascent Methods
• On Steepest Descent
• A Stochastic Approximation Method
• The method of steepest descent for non-linear minimization problems
• Phase Retrieval via Matrix Completion

This page was built for publication: An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations