Alternating minimization as sequential unconstrained minimization: a survey

DOI10.1007/s10957-012-0134-2zbMath1262.90164OpenAlexW2011716365MaRDI QIDQ1949577

Charles L. Byrne

Publication date: 8 May 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0134-2

zbMATH Keywords

optimizationalternating minimizationsequential unconstrained optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation ⋮ Distance majorization and its applications ⋮ Restoration of blurred color images with impulse noise ⋮ An MM Algorithm for Split Feasibility Problems

Cites Work

• Proximal minimization algorithm with \(D\)-functions
• A multiprojection algorithm using Bregman projections in a product space
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Iterating Bregman Retractions
• A Statistical Model for Positron Emission Tomography
• Sequential unconstrained minimization algorithms for constrained optimization
• Generalized Iterative Scaling for Log-Linear Models
• On Information and Sufficiency
• Maximum penalized likelihood estimation. Vol. 1: Density estimation
• Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating minimization as sequential unconstrained minimization: a survey