scientific article; zbMATH DE number 3121286
From MaRDI portal
Publication:3236244
zbMATH Open0072.37603MaRDI QIDQ3236244FDOQ3236244
Authors: Richard J. Duffin 
Publication date: 1956
Title of this publication is not available (Why is that?)
Cited In (70)
- Understanding badly and well-behaved linear matrix inequalities via semi-infinite optimization
- Symmetric Duality for Structured Convex Programs
- Sur les programmes convexes definis dans des espaces vectoriels topologiques
- Zur Dualitätstheorie bei linearen Optimierungsproblemen in halbgeordneten Vektorräumen
- A duality theory for abstract mathematical programs with applications to optimal control theory
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- On the question of representation of ultrafilters in a product of measurable spaces
- Stable monotone variational inequalities
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Projection: A unified approach to semi-infinite linear programs and duality in convex programming
- Asymptotic duality over closed convex sets
- Corrigendum to: ``Operator monotone functions and Löwner functions of several variables
- A generalization of the Alaoglu-Bourbaki theorem and its applications
- Linear programs in topological vector spaces
- Constructing a perfect duality in infinite programming
- Necessary and sufficient conditions for solving infinite-dimensional linear inequalities
- Separably-infinite programs
- Some perturbation theory for linear programming
- Solution of nonlinear optimal control problems in Hilbert spaces by means of linear programming techniques
- Classifying convex extremum problems over linear topologies having separation properties
- The extremal length of a network
- Duality in infinite dimensional linear programming
- New upper bounds for kissing numbers from semidefinite programming
- Matrix relaxations in combinatorial optimization
- The determinant bound for discrepancy is almost tight
- Fabrication-adaptive optimization with an application to photonic crystal design
- Circuit duality for recurrent Markov processes
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- The theorem of the alternative, the key-theorem, and the vector-maximum problem
- Strong duality and minimal representations for cone optimization
- On semi-infinite systems of linear inequalities
- Duality and asymptotic solvability over cones
- Representation of attraction elements in abstract attainability problems with asymptotic constraints
- Optimierungsaufgaben in topologischen Vektorr�umen I: Dualit�tstheorie
- Duality gap function in infinite dimensional linear programming
- Semidefinite programming and combinatorial optimization
- On the question of representation of ultrafilters and their application in extension constructions
- Convex analysis treated by linear programming
- Numerical treatment of a class of semi‐infinite programming problems
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
- On obeying constraints of asymptotic character
- Discrete infinite transportation problems
- A necessary and sufficient condition for the positivity of the growth rate in the Neumann-Gale model of economic growth
- Linear programming, complexity theory and elementary functional analysis
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Linear programming and operator means
- Projection methods for quantum channel construction
- Some topological structures of extensions of abstract reachability problems
- Strong duality for standard convex programs
- The Lagrange approach to infinite linear programs
- On coderivatives and Lipschitzian properties of the dual pair in optimization
- A review of duality theory for linear programming over topological vector spaces
- A note on infinite systems of linear inequalities in R\(^n\)
- Duality gaps in semi-infinite linear programming—an approximation problem
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Infinite programming and duality in topological vector spaces
- Bad semidefinite programs: they all look the same
- Intrinsic linear programming
- Zur Dualitätstheorie bei linearen Optimierungsproblemen in halbgeordneten Vektorräumen
- Invariant Semidefinite Programs
- Lineare Optimierung in halbgeordneten Vektorräumen
- Continuous programs and their relation to continuous games
- An application of semi-infinite linear programming: approximation of a continuous function by a polynomial
- A characterisation of the feasible set of objective function vectors in linear multiple objective problems
- Linear programming in complex space
- Symmetric duality in continuous-time programming via minmax duality
- On rigidity and realizability of weighted graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236244)
