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