A trust-region-based splitting method for optimization problems with linear constraints

DOI10.1007/978-981-96-8574-5_1MaRDI QIDQ7234038zbMATH OpenFDO

Authors Leyu Hu, Yannan Chen, Xing-Ju Cai, Deren Han

Publication date 27 April 2026

Full work available at URL https://doi.org/10.1007/978-981-96-8574-5_1

zbMATH Keywords

convergence rateseparable convex optimizationsplitting methodtrust region

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A descent method for structured monotone variational inequalities
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• A new inexact alternating directions method for monotone variational inequalities
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Alternating direction method for covariance selection models
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• An improved proximal alternating direction method for monotone variational inequalities with separable structure
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Atomic Decomposition by Basis Pursuit
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Matrix completion via an alternating direction method
• Nonlinear total variation based noise removal algorithms
• Nonnegative tensor factorizations using an alternating direction method
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Optimization theory and methods. Nonlinear programming
• Positive semidefinite generalized diffusion tensor imaging via quadratic semidefinite programming
• Proximal alternating directions method for structured variational inequalities
• Self-adaptive projection-based prediction-correction method for constrained variational inequalities
• Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• The Split Bregman Method for L1-Regularized Problems
• Trust Region Methods

This page was built for publication: A trust-region-based splitting method for optimization problems with linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234038)