scientific article; zbMATH DE number 3323651

zbMath0203.52203MaRDI QIDQ5603731

Josef Stoer, Christoph Witzgall

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

On existence and uniqueness of maximum likelihood estimates in quantal and ordinal response models, Least elements revisited, Minimal ellipsoids and their duals, A polynomial-time algorithm for a class of linear complementarity problems, Generalized scalings satisfying linear equations, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program, Stability in multicriteria optimization, Decomposability in fixed point computation with applications and acceleration techniques, Generalization of Fenchel's duality theorem for convex vector optimization, Necessary conditions for Pareto optimality in simultaneous Chebyshev best approximation, Existence of optimal Lagrange multipliers for certain nonconvex allocation problems, An iterative row-action method for interval convex programming, The morphology and stability of material phases, Linear programs with an additional reverse convex constraint, On maximum tests for normal distributions, On intersections of interval graphs, Lexocographic multipliers, Reverse convex programming, A cone separation theorem, Proper efficiency with respect to cones, Fractional programming: Applications and algorithms, Some inverse problems involving conditional expectations, On an application of game theory to a problem of testing statistical hypothesis, A limiting infisup theorem, Theory of cones, On proper and improper efficient solutions of optimal problems with multicriteria, Higher-order necessary conditions for infinite and semi-infinite optimization, On total dual integrality, Instant controllability of linear autonomous systems, A constant-time parallel algorithm for computing convex hulls, Nine kinds of quasiconcavity and concavity, On matrices leaving invariant a nontrivial convex set, Extreme positive operators on minimal and almost minimal cones, Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen, Closedness of cones, A characterization of lower semicontinuity of the boundary of a -- multifunction in normed spaces, A topological characterization for closed sets under polar duality in \({\mathbb{Q}{}}^ n\), The equivalence of two partial orders on a convex cone of positive semidefinite matrices, On some efficient interior point methods for nonlinear convex programming, A finite algorithm for solving the generalized lattice point problem, An analytical comparison of different formulations of the travelling salesman problem, The complexity of problems involving structurally bounded and conservative Petri nets, Geometric and combinatorial properties of the polytope of binary choice probabilities, A representation of the set of feasible objectives in multiple objective linear programs, Five variations on a theme by Gyula Farkas, Normal and sinkless Petri nets, On the realization of convex polytopes, Euler's formula and Möbius functions, A note on infinite systems of linear inequalities in R\(^n\), An inductive proof of a fundamental maximin theorem, Über die Existenz von Minima konvexer Funktionen, Generalization of domination structures and nondominated solutions in multicriteria decision making, Brouwer's fixed point theorem and finite state space Markovian decision theory, Kriterien erster und zweiter Ordnung für lokal beste Approximationen bei Problemen mit Nebenbedingungen, The continuity of the optimum in parametric programming and applications to stochastic programming, The generalized inverse in parametric programming, A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems, Algebraic Perron-Frobenius theory, A note on symmetric doubly-stochastic matrices, The set of all nondominated solutions in linear cases and a multicriteria simplex method, A proof of Fulkerson's characterization of permutation matrices, Dynamic programming and duality in linear programming, A characterization of state spaces of orthomodular lattices, Self-dual cones in Euclidean spaces, Several remarks on convex optimization on infinite dimensional vector spaces, A globally convergent method for nonlinear programming, Discrete, non-linear approximation problems in polyhedral norms, Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm, Pareto optimality in multiobjective problems, Affine minorants minimizing the sum of convex functions, The saddle point theorem of Kuhn and Tucker in ordered vector spaces, A converse for disjunctive constraints, Connectedness of the set of nondominated outcomes in multicriteria optimization, The value function of a mixed integer program: I, Game theoretical treatment of material accountability problems. I, Projection and restriction methods in geometric programming and related problems, Integral of a set-valued function with semi-closed values, Constructing a perfect duality in infinite programming, A note on the extension principle for fuzzy sets, Necessary and sufficient conditions for local and global nondominated solutions in decision problems with multi-objectives, Unique winning policies for linear differential pursuit games, The structure of admissible points with respect to cone dominance, Finding the intersection of two convex polyhedra, Minimal inequalities for mixed integer programs, Durchschnitte und Vereinigung monotoner Folgen spezieller konvexer Körper, The inverse balayage problem for Markov chains, part II, Cutting-plane theory: Algebraic methods, A recurring theorem about pairs of quadratic forms and extensions: A survey, The value function of a mixed integer program. II, Two mixed integer programming formulations arising in manufacturing management, On the asymptotic average number of efficient vertices in multiple objective linear programming, Disjunctive programming: Properties of the convex hull of feasible points, Convexity and openness with linear rate, Fenchel-type duality for matroid valuations, Discrete convex analysis, Directional monotonicity properties of the power functions of likelihood ratio tests for cone-restricted hypotheses, Global stability of an age-structure model for TB and its applications to optimal vaccination strategies, Convergence of certain bounded sequences, On matrices satisfying a maximum principle with respect to a cone, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, On the flatness of digital hyperplanes, Estimation of a parameter vector restricted to a cone, Global \(C^{1,\alpha}\) regularity for Monge-Ampère equation and convex envelope, Strengthening Gilmore's bound for the quadratic assignment problem, Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory, An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane, On the efficiency of convex polyhedra, Quadratic M-convex and L-convex functions, A general algorithm for determining all essential solutions and inequalities for any convex polyhedron, Asymptotic theory for bent-cable regression -- the basic case, Vector-valued Markov decision processes and the systems of linear inequalities, The general nonstrict algebraic Riccati inequality, Evaluating credal classifiers by utility-discounted predictive accuracy, Bounded self-stabilizing Petri nets, On regularity and stability in semi-infinite optimization, Extending uncertainty formalisms to linear constraints and other complex formalisms, Canonical analysis of two convex polyhedral cones and applications, Testing strictly concave rationality, The \(C_ M\)-embedded problem and optimality conditions, Complexity of integer quasiconvex polynomial optimization, D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems, Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints, Diewert-Crouzeix conjugation for general quasiconvex duality and applications, Duality theorem for a generalized Fermat-Weber problem, Theorems of the alternative revisited and some extensions of Yuan's lemma, Quasiconcavity and nondominated solutions in multiobjective programming, A real nullstellensatz with multiplicity, Theorems of the alternative and duality, Convex polarities over ordered fields, The existence and uniqueness of steady states for a class of chemical reaction networks, A closed-form representation of mixed-integer program value functions, On finite linear systems containing strict inequalities, On a conjecture concerning a theorem of Cramér and Wold, Interpolation and approximation from convex sets, Parametric Nash coalitive differential games, Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\), Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\), A note of Lipschitz constants for solutions of linear inequalities and equations, Toward nonquadratic S-lemma: new theory and application in nonconvex optimization, Conjugate duality for constrained optimization via image space analysis and abstract convexity, Kriterien zweiter Ordnung für lokal beste Approximationen, Moreau-type characterizations of polar cones, Reachability and connectivity queries in constraint databases, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization, Strong vector equilibrium problems, Non-quadratic extension of homogeneous S-lemma and its applications in optimization, A note on Burer's copositive representation of mixed-binary QPs, PPLite: zero-overhead encoding of NNC polyhedra, A two-person noncooperative game for assets selling problem: Independent case. Sixth International Workshop of the Bellman Continuum (Hachioji, 1994), Evenly convex credal sets, Passivity and complementarity, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, The restricted EM algorithm under inequality restrictions on the parameters, Ein Iterationsverfahren für lineare Ungleichungssysteme, On the posets \((\mathcal W_2^k,<)\) and their connections with some homogeneous inequalities of degree 2, Exact join detection for convex polyhedra and other numerical abstractions, A procedure of Chvátal for testing feasibility in linear programming and matrix scaling, The distance between two convex sets, Analysis of an age structured SEIRS epidemic model with varying total population size and vaccination, Estimation of a location parameter with restrictions or ``vague information for spherically symmetric distributions, On affinely embeddable sets in the projective plane, Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space, Probabilistic sensitivity measures as information value, Digital idle speed control of automotive engines: a safety problem for hybrid systems, Consistent estimation with many moment inequalities, On linear passive complementarity systems, Quadratic optimization over a polyhedral cone, Structure of a simple scheduling polyhedron, The stop operator related to a convex polyhedron, Steklov regularization and trajectory methods for univariate global optimization, Tangible convex bodies. Appendix to Multivariable Wiener-Hopf operators. I, A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue, Interpolation type problem in the class of positive trigonometric polynomials of fixed order, A robust sequential quadratic programming method, Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, Representability of functions, The lattice of faces of a finite dimensional cone, A Nullstellensatz and a Positivstellensatz in semialgebraic geometry, Separating risk and return in the CAPM: A general utility-based model, Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives, A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance, Unique representation in convex sets by extraction of marked components, Topological stability of linear semi-infinite inequality systems, Operations that preserve total dual integrality, Philon's line generalized: An optimization problem from geometry, Extension of M-convexity and L-convexity to polyhedral convex functions, 'Envelope programming' and conjugate duality, Dykstra's algorithm with strategies for projecting onto certain polyhedral cones, Classifying convex extremum problems over linear topologies having separation properties, An extension of a theorem of Jeroslow and Kortanek, Analyzing linear systems containing strict inequalities via evenly convex hulls, Improving complexity of structured convex optimization problems using self-concordant barriers, Substitutes and complements in network flows viewed as discrete convexity, A fuzzy ordering on multi-dimensional fuzzy sets induced from convex cones, Graph-theoretical properties of parallelism in the digital plane, Stability of multicriteria nonlinear programming problems using fuzziness, Sufficient algebraic conditions for stability of cones of polynomials, Topological properties of Hausdorff discretization, and comparison to other discretization schemes., Nonsingularity and symmetry for linear normal maps, A note on the existence of subgradients, Unnamed Item, A general min-max theorem, A finite cutting plane method for facial disjunctive programs, Symmetrized Separable Convex Programming, Unnamed Item, The polynomial hierarchy and a simple model for competitive analysis, On Fan's minimax theorem, Sharing problems, Anomalies in the Foundations of Ridge Regression, Unnamed Item, A new geometric approach for sensitivity analysis in linear programming, A Bound on Solutions of Linear Integer Equalities and Inequalities, A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems, Unnamed Item, Unnamed Item, Error bounds for solutions of linear equations and inequalities, Some further aspects of the löwner-ordering antitonicity of the moore-penrose inverse, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Uniform duality in semi-infinite convex optimization, Polyhedral Combinatorics in Combinatorial Optimization, THE METRIC PROJECTIONS ONTO CLOSED CONVEX CONES IN A HILBERT SPACE, Unnamed Item, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Duality Theorems and Theorems of the Alternative, Linear multicriteria sensitivity and shadow costs, A decision procedure using the geometry of convex sets, Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC, Unnamed Item, Fenchel and Lagrange duality are equivalent, On directions of strictness, affinity and constancy and the minimum set of a proper convex function, A “from scratch” proof of a theorem of Rockafellar and Fulkerson, Complete extension of a convex function, A Calculation of all Separating Hyperplanes of two Convex Polytopes, On hardly linearly provable systems, Sensitivity theorems in integer linear programming, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, Properties of the solution set of evolution inclusions, Über lösungsmengen spezieller konvexer parametrisher optimierungsaufgaben, Second order optimality conditions for generalized semi-infinite programming problems, Saddlepoints for convex programming in order vector spaces, A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup>, Estimates for Kuhn-Tucker points of perturbed convex programs, On existence and uniqueness of a vector minimizing a convex function, A Generalization of the Aramata-Brauer Theorem, Asymptotic prime-power divisibility of binomial, generalized binomial, and multinomial coefficients, Asymptotic contact of the $k$-th order of convex sets, A Cutting Plane Algorithm for Min-Max Fractional Programming, Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions, Finding the nearest point in A polytope, Second Order Differentiability of Convex Functions in Banach Spaces, On the subdifferential of a submodular function, On a calculation of an arbitrary separating hyperplane of convex polyhedral sets, Separating support hyperplanes for a pair of convex polyhedral sets, Lexicographic quasiconcave multiobjective programming, On characterizingL 1-supports, natural and Chebyshev approximates, Unnamed Item, Optimal-Partitioning Inequalities for Nonatomic Probability Measures, On the symmetric travelling salesman problem I: Inequalities, Separably-infinite programs, Lifting the facets of zero–one polytopes, Dualities between complete lattices, Multivalued convexity and optimization: A unified approach to inequality and equality constraints, A generalization of the Frank—Wolfe theorem, An Algebraic Study of Affine Real Ultrafilters, On the Smoothness of Convex Envelopes, Second order characterizations of pseudoconvex functions, Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems, Comparison of stop rule and maximum expectations for finite sequences of exchangeable random variables, Una generalizacion de la caracterizacion de puntos extremos, An alternative method for a global analysis of quadratic programs in a finite number of steps, Imaginary cone and reflection subgroups of Coxeter groups, A superharmonic approach to solving infinite horizon partially observable Markov decision problems, A method for globally minimizing concave functions over convex sets, Solving a Type of the Tikhonov Regularization of the Total Least Squares by a New S-Lemma, Faces and duality in convex cones, Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming, Polyextremal principles and separably-infinite programs, Convex optimization and lagrange multipliers, On a property of polyhedral sets, Duality theorems for certain programs involving minimum or maximum operations, Characterizations of strictly convex sets by the uniqueness of support points, A Graphic Formulation of Nonisothermal Chemical Reaction Systems and the Analysis of Detailed Balanced Networks, Global saddle-point duality for quasi-concave programs, Duality for semi-definite and semi-infinite programming, Ellipse Detection with Elemental Subsets, Semi-infinite programming duality for order restricted statistical inference models, Between Pareto efficiency and Pareto ε-efficiency, An elementary survey of general duality theory in mathematical programming, Techniques of linear programming based on the theory of convex cones, Optimum matching forests II: General weights, Optimum matching forests III: Facets of matching forest polyhedra, Direct theorems in semi-infinite convex programming, Test of equality of normal means in the absence of independent estimator of variance, The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup>, On relations and applications of generalized second-order directional derivatives, Supports and convex envelopes, On semi-infinite minmax programming with generalized invexity, Global saddle-point duality for quasi-concave programs, II, Polyhedral extensions of some theorems of linear programming, On minimal positive basis for polyhedral cones in Rn, Prophet Regions for Independent [0, 1-Valued Random Variables with Random Discounting], Polytopes, graphs, and complexes, Recent progress on integrally convex functions, The second boundary value problem for a discrete Monge-Ampère equation, A new geometric approach to multiobjective linear programming problems, Integer programming and convex analysis: Intersection cuts from outer polars, Quasi-convexity, strictly quasi-convexity and pseudo-convexity of composite objective functions, Unnamed Item, Separating objects in the plane by wedges and strips, The complexity of linear programming, Differential equations. Transl. from the Russian, Isotone functions, dual cones, and networks, Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella., Contractibility of the efficient frontier of three-dimensional simply-shaded sets., Optimal Difference Operator Selection, Additively decomposed quasiconvex functions, Unique decompositions, faces, and automorphisms of separable states, Heilbronn characters, Connectivity of Quadratic Hypersurfaces and Its Applications in Optimization, Part I: General Theory, Extensions of a theorem of Balas, Complementation in the face lattice of a proper cone, Prophet regions and sharp inequalities for pth absolute moments of martingales, A remark on the faces of the cone of Euclidean distance matrices, Polyhedral functions and multiparametric linear programming, Extensions of Radstrom's lemma with application to stability theory of mathematical programming, Stop rule and supremum expectations of i.i.d. random variables: A complete comparison by conjugate duality, Efficient constraint/generator removal from double description of polyhedra, Nonasymptotic necessary conditions for nonsmooth infinite optimization problems, Representability in mixed integer programming. I: Characterization results, Extensions of subgradient projection algorithms, Existence of solutions of games with some non-convexity, Simultaneous congruence of convex compact sets of Hermitian matrices with constant rank, On tridiagonal linear complementarity problems, An out-of-kilter method for submodular flows, An unconstrained dual program for computing convex \(C^ 1\)-spline approximants, Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, Visibility between two edges of a simple polygon, Assessing statistical significance in variance components linkage analysis: a theoretical justification, Combinatorial behavior of extreme points of perturbed polyhedra, A lemma on convex functionals in finite-dimensional spaces, Minimum polygonal separation, Spline interpolation between hyperspaces of convex or fuzzy sets, Valuations and polarity, Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function, A simplification for some disjunctive formulations, Minimizing a quasi-concave function subject to a reverse convex constraint, The extreme points of a set of positive semidefinite operators, Determination of shape preserving spline interpolants with minimal curvature via dual programs, A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems, Completeness results for conflict-free vector replacement systems, On selecting the k largest with median tests, Finite function spaces and measures on hypergraphs, Positive sets in finite linear function spaces, The method of characteristics for Hamilton-Jacobi equations and applications to dynamical optimization, Likelihood relations and stochastic preferences, Minimum recession-compatible subsets of closed convex sets, A generic force-closure analysis algorithm for cable-driven parallel manipulators, The existence of sampling designs with preassigned inclusion probabilities, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, Wythoff's construction for Coxeter groups, Algorithms for high dimensional stabbing problems, The spectral norm of a nonnegative matrix, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Bounding contingent claim prices via hedging strategy with coherent risk measures, Extreme point inequalities and geometry of the rank sparsity ball, An alternating iterative method and its application in statistical inference, Application of continuous-time programming problems to a class of variational-type inequalities, ``What is a complex matroid?, A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio, On the local uniqueness of solutions of variational inequalities under \(H\)-differentiability, Conic formulation for \(l_p\)-norm optimization, Efficient, Pareto-improving processes, An active index algorithm for the nearest point problem in a polyhedral cone, Maximization of generalized convex functionals in locally convex spaces., Locally unique solutions of nonsmooth general variational inequalities, On cone of nonsymmetric positive semidefinite matrices, A representation of convex semilinear sets, Rectangular products of lattices, Optimal harvesting and optimal vaccination, Substitute goods, auctions, and equilibrium, Feature controlled adaptive difference operators, Neighbourhood search for constructing Pareto sets, On reoptimizing multi-class classifiers, Solving multiple objective linear programs in objective space, Large-scale 0-1 linear programming on distributed workstations, On cone orderings and the linear complementarity problem, Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints, Prophet region for independent random variables with a discount factor, Sphere packings and hyperbolic reflection groups, On a pair of nonlinear mixed integer programming problems, A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors, Applications of polyhedral computations to the analysis and verification of hardware and software systems, Regularity conditions in differentiable vector optimization revisited, Recent trends in combinatorial optimization, Some properties of \(Q\)-matrices, Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data, Convergence of a subgradient method for computing the bound norm of matrices, Lipschitz conditions, strong uniqueness, and almost Chebyshev subspaces of C(X), A unified approach to the feasible direction methods for nonlinear programming with linear constraints, Derivatives of the Perron root at an essentially nonnegative matrix and the group inverse of an M-matrix, Total weak unimodularity: Testing and applications, Criteria for approximation of linear and affine functions, Individual autonomy in organizations, On the inversion of exponential sums in the neighbourhood of transcendental critical points, Cluster sets of vector series, Complete controllability, Constructive characterizations of the value function of a mixed-integer program. II, On discrete-time linear systems over cones, Polarity and inner products in oriented matroids, Pitman estimation on \({\mathbb{R}}^ k\), On \(\ell_ p\) programming, Convex semi-infinite games, On consistency of linear linearly constrained discrete time systems, Minimization of intermediate concentrations as a suggested optimality principle for biochemical networks. I: Theoretical analysis, Operator-semistable operator Lévy's measures on finite dimensional vector spaces, An algorithm for two-stage stochastic mixed-integer nonlinear convex problems, A nonlinear scattering problem, On the minima of functionals with linear growth, Projection, lifting and extended formulation integer and combinatorial optimization