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

DOI10.1007/S10957-012-0150-2MaRDI QIDQ353167zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Alternating direction method for maximum entropy subject to simple constraint sets.
• scientific article; zbMATH DE number 1279829
• Dual multiplicative algorithms for an entropy-linear programming problem
• scientific article; zbMATH DE number 1150153
• Technical Note—An Algorithm for a Class of Discrete Maximum Entropy Problems

Cites work

• scientific article; zbMATH DE number 3143969 (Why is no real title available?)
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3777268 (Why is no real title available?)
• scientific article; zbMATH DE number 48436 (Why is no real title available?)
• scientific article; zbMATH DE number 635657 (Why is no real title available?)
• scientific article; zbMATH DE number 967931 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Newton-CG augmented Lagrangian method for semidefinite programming
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• A nonsmooth version of Newton's method
• A note on solution of large sparse maximum entropy problems with linear equality constraints
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• An algorithm for maximizing entropy subject to simple bounds
• An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
• 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
• Entropy optimization and mathematical programming
• Information Theory and Statistical Mechanics
• Linear programming with entropic perturbation
• Matrix inequalities in statistical mechanics.
• Maximum entropy image reconstruction: general algorithm
• Maximum entropy regularization of Fredholm integral equations of the first kind
• Optimization and nonsmooth analysis
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• Smooth minimization of non-smooth functions
• Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm

Cited in

(6)

• Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
• Computing proximal points of convex functions with inexact subgradients
• An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
• A fast Newton method for entropy maximization in statistical phase estimation
• Randomized iterative methods for linear systems
• An algorithm for solution of the Sylvester s‐conjugate linear equation for the commutative elliptic octonions

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

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