Convex programming and systems of elementary monotonic relations
From MaRDI portal
Cites work
- A theorem on maximal monotonic sets in Hilbert space
- Characterization of the subdifferentials of convex functions
- Duality and stability in extremum problems involving convex functions
- Duality theorems for convex functions
- scientific article; zbMATH DE number 3179986 (Why is no real title available?)
- scientific article; zbMATH DE number 3227800 (Why is no real title available?)
- scientific article; zbMATH DE number 3231714 (Why is no real title available?)
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- Monotone networks
- On Conjugate Convex Functions
Cited in
(11)- Proof of global convergence of an efficient algorithm for predicting trip generation, trip distribution, modal split and traffic assignment simultaneously on large-scale networks
- Infinite nonlinear resistive networks, after Minty
- Metric and ultrametric inequalities for directed graphs
- An improved origin-based algorithm for solving the combined distribution and assignment problem
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Duality in Countably Infinite Monotropic Programs
- Duale Optimierungsaufgaben und Sattelpunktsätze
- Inversion of real-valued functions and applications
- Circuit analysis using monotone+skew splitting
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
This page was built for publication: Convex programming and systems of elementary monotonic relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525908)
