Extended monotropic programming and duality
From MaRDI portal
Publication:1014019
DOI10.1007/s10957-008-9393-3zbMath1163.90015OpenAlexW2145072018MaRDI QIDQ1014019
Publication date: 24 April 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9393-3
Related Items (14)
The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem ⋮ An approach for the convex feasibility problem via monotropic programming ⋮ A computational theory of decision networks ⋮ Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems ⋮ Separable approximations and decomposition methods for the augmented Lagrangian ⋮ k-Certainty Exploration Method: an action selector to identify the environment in reinforcement learning ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ On a zero duality gap result in extended monotropic programming ⋮ Duality in Countably Infinite Monotropic Programs ⋮ A flexible ADMM algorithm for big data applications ⋮ Measuring and repairing inconsistency in probabilistic knowledge bases ⋮ Duality for extended infinite monotropic optimization problems ⋮ An augmented Lagrangian method for distributed optimization ⋮ Algebraic approach to duality in optimization and applications
Cites Work
This page was built for publication: Extended monotropic programming and duality
