An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem

DOI10.1007/s10957-012-0150-2zbMath1267.90095OpenAlexW2061515899MaRDI QIDQ353167

Aimin Xu, Cheng-Jing Wang

Publication date: 12 July 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-0150-2

zbMATH Keywords

Newton-CG methodinexact accelerated proximal gradient methodmaximal entropy problemsemi-smoothness

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (4)

Randomized Iterative Methods for Linear Systems ⋮ Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ An algorithm for solution of the Sylvester s‐conjugate linear equation for the commutative elliptic octonions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An algorithm for maximizing entropy subject to simple bounds
• Entropy optimization and mathematical programming
• Matrix inequalities in statistical mechanics.
• A nonsmooth version of Newton's method
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
• Information Theory and Statistical Mechanics
• Maximum entropy image reconstruction: general algorithm
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• Optimization and nonsmooth analysis
• A note on solution of large sparse maximum entropy problems with linear equality constraints
• Maximum entropy regularization of Fredholm integral equations of the first kind
• An unconstrained convex programming view of linear programming
• Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
• Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
• An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
• Linear programming with entropic perturbation

This page was built for publication: An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem