Sufficient conditions for the convergence of monotonic mathematical programming algorithms

DOI10.1016/S0022-0000(76)80021-9zbMath0337.65037OpenAlexW2043230024MaRDI QIDQ1230497

Robert R. Meyer

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80021-9

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Algorithms in computer science (68W99)

Related Items (18)

Estimating a common period for a set of irregularly sampled functions with applications to periodic variable star data ⋮ A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory ⋮ Generic Half-Quadratic Optimization for Image Reconstruction ⋮ Regularized generalized canonical correlation analysis: a framework for sequential multiblock component methods ⋮ Distance majorization and its applications ⋮ Majorization-minimization algorithms for nonsmoothly penalized objective functions ⋮ Biconvex sets and optimization with biconvex functions: a survey and extensions ⋮ Portfolio optimization with linear and fixed transaction costs ⋮ A convergence theorem of Rosen’s gradient projection method ⋮ A convergence theory for a class of anti-jamming strategies ⋮ Remarks on the convergence of Rosen's gradient projection method ⋮ Discussion on the convergence of Rosen's gradient projection method ⋮ Inexact Half-Quadratic Optimization for Linear Inverse Problems ⋮ Global convergence of Rosen's gradient projection method ⋮ Variational image binarization and its multi-scale realizations ⋮ Stochastic proximal-gradient algorithms for penalized mixed models ⋮ Some notions of nonstationary multistep iteration processes ⋮ Half-linear regularization for nonconvex image restoration models

Cites Work

• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• On the Convergence of Algorithms with Restart
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• The Validity of a Family of Optimization Methods
• Application of Liapunov's Direct Method to Fixed Point Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sufficient conditions for the convergence of monotonic mathematical programming algorithms