MAP inference via \(\ell_2\)-sphere linear program reformulation

DOI10.1007/s11263-020-01313-2zbMath1483.62097OpenAlexW3009801594MaRDI QIDQ2056127

Yanyan Li

Publication date: 1 December 2021

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-020-01313-2

zbMATH Keywords

nonconvex optimizationMAP inferencecontinuous reformulation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Probabilistic graphical models (62H22)

Uses Software

• mplp2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Global convergence of ADMM in nonconvex nonsmooth optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Anytime AND/OR depth-first search for combinatorial optimization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• The Cutting-Plane Method for Solving Convex Programs
• An Automatic Method of Solving Discrete Programming Problems
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Clarke Subgradients of Stratifiable Functions
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Graphical Models, Exponential Families, and Variational Inference
• Factor graphs and the sum-product algorithm
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

This page was built for publication: MAP inference via \(\ell_2\)-sphere linear program reformulation