Extended monotropic programming and duality
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Convex Analysis
- Some convex programs without a duality gap
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
Cited in
(19)- scientific article; zbMATH DE number 3853853 (Why is no real title available?)
- Separable approximations and decomposition methods for the augmented Lagrangian
- k-Certainty Exploration Method: an action selector to identify the environment in reinforcement learning
- Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
- Strong duality for generalized monotropic programming in infinite dimensions
- Duality in Countably Infinite Monotropic Programs
- A computational theory of decision networks
- On a zero duality gap result in extended monotropic programming
- An approach for the convex feasibility problem via monotropic programming
- Algebraic approach to duality in optimization and applications
- Computational aspects of monotone dualization: a brief survey
- The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem
- scientific article; zbMATH DE number 3939102 (Why is no real title available?)
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- An augmented Lagrangian method for distributed optimization
- Duality for extended infinite monotropic optimization problems
- scientific article; zbMATH DE number 3867079 (Why is no real title available?)
- Measuring and repairing inconsistency in probabilistic knowledge bases
- A flexible ADMM algorithm for big data applications
This page was built for publication: Extended monotropic programming and duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014019)