The regularization continuation method for optimization problems with nonlinear equality constraints

DOI10.1007/s10915-024-02476-7arXiv2303.14692MaRDI QIDQ6196231

Sen Zhang, Xin-long Luo, Hang Xiao

Publication date: 14 March 2024

Published in: Journal of Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

continuation methodregularization techniquequasi-Newton methodtrust-region methodSherman-Morrison-Woodbury formulapreconditioned technique

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical optimization and variational techniques (65K10) Preconditioners for iterative methods (65F08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
• A feasible method for optimization with orthogonality constraints
• Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
• Approximate greatest descent methods for optimization with equality constraints
• A function to test methods applied to global minimization of potential energy of molecules
• Removing multiplicative noise by Douglas-Rachford splitting methods
• A comparative performance evaluation of 27 nonlinear programming codes
• A globally convergent method for nonlinear programming
• A geometric method in nonlinear programming
• Construction of high order diagonally implicit multistage integration methods for ordinary differential equations
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Inexact trust region method for large sparse systems of nonlinear equations
• The BFGS method with exact line searches fails for non-convex objective functions
• Neurodynamical optimization
• One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization
• An alternating direction method for finding Dantzig selectors
• Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization
• Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system
• Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations
• Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data
• The regularization continuation method with an adaptive time step control for linearly constrained optimization problems
• A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems
• A prediction-correction dynamic method for large-scale generalized eigenvalue problems
• A subspace SQP method for equality constrained optimization
• Recent advances in trust region algorithms
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Optimization theory and methods. Nonlinear programming
• Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• Projected Pseudotransient Continuation
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• A differential equation approach to nonlinear programming
• Testing Unconstrained Optimization Software
• The Geometry of Algorithms with Orthogonality Constraints
• Numerical Optimization
• Solving ODEs with MATLAB
• Introduction to Numerical Continuation Methods
• Pseudotransient Continuation and Differential-Algebraic Equations
• A dynamical systems approach to constrained minimization
• Trust Region Methods
• Trust Region Algorithms and Timestep Selection
• A General Class of Two-Step Runge–Kutta Methods for Ordinary Differential Equations
• Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• A Rapidly Convergent Descent Method for Minimization
• Restoration of Poissonian Images Using Alternating Direction Optimization
• Dynamical System Characterization of the Central Path and Its Variants—A Revisit
• Convergence analysis of the Levenberg–Marquardt method
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Conditioning of Quasi-Newton Methods for Function Minimization
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• A method for the solution of certain non-linear problems in least squares
• Benchmarking optimization software with performance profiles.

This page was built for publication: The regularization continuation method for optimization problems with nonlinear equality constraints