A Lipschitzian Characterization of Convex Polyhedra
From MaRDI portal
Publication:5572081
DOI10.2307/2037511zbMATH Open0182.25003OpenAlexW4231948783MaRDI QIDQ5572081FDOQ5572081
Authors: David W. Walkup, Roger J.-B. Wets
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/2037511
Cites Work
Cited In (34)
- Stability of the extreme point set of a polyhedron
- Stochastic programs with recourse: A basic theorem for multistage problems
- An algorithm for approximate multiparametric linear programming
- An inertial proximal scheme for nonmonotone mappings
- A representation of generalized convex polyhedra and applications
- Second-Order Variational Analysis of Parametric Constraint and Variational Systems
- Local properties and augmented Lagrangians in fully nonconvex composite optimization
- Directional end of a convex set: theory and applications.
- Stochastic programs with recourse: A basic theorem for multistage problems
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
- Error bounds in mathematical programming
- The value of two-person zero-sum repeated games. The extensive case
- Note on The value of two-person zero-sum repeated games. The extensive case
- Lipschitz modulus of the optimal value in linear programming
- Hölder continuity of solutions to elastic traffic network models
- Best Lipschitz constants of solutions of quadratic programs
- Limit laws for empirical optimal solutions in random linear programs
- Hoffman's least error bounds for systems of linear inequalities
- A stability result for linear Markovian stochastic optimization problems
- Continuous Selections of Solutions to Parametric Variational Inequalities
- Lipschitzian stability in linear semi-infinite optimization
- On finite linear systems containing strict inequalities
- Directional derivative of the value function for parametric set-constrained optimization problems
- Quantitative stability of variational systems. III: \(\varepsilon\)- approximate solutions
- Calmness of the optimal value in linear programming
- Sensitivity analysis of stochastic constraint and variational systems via generalized differentiation
- Approachability, regret and calibration: implications and equivalences
- Title not available (Why is that?)
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Local conicity and polyhedrality of convex sets
- Full stability of general parametric variational systems
- Lower semicontinuity of the feasible set mapping of linear systems relative to their domains
- Local Error Bounds for Affine Variational Inequalities on Hilbert Spaces
- Error bounds for solutions of linear equations and inequalities
This page was built for publication: A Lipschitzian Characterization of Convex Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572081)