Selected applications of linear semi-infinite systems theory
From MaRDI portal
Publication:2022431
DOI10.1007/s10013-020-00415-1zbMath1475.51012OpenAlexW3024925482MaRDI QIDQ2022431
Virginia N. Vera de Serio, Andrea B. Ridolfi, Miguel Angel Goberna
Publication date: 29 April 2021
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/108699
Related Items (3)
Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ A radius of robust feasibility for uncertain farthest Voronoi cells ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- The Voronoi inverse mapping
- On metric regularity and the boundary of the feasible set in linear optimization
- Separating the solution sets of analytical and polynomial systems
- Motzkin decomposition of closed convex sets
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Stability in linear optimization under perturbations of the left-hand side coefficients
- Polyhedral Voronoi cells
- On Motzkin decomposable sets and functions
- Cyclic convex bodies and optimization moment problems
- A theory of linear inequality systems
- Farkas-Minkowski systems in semi-infinite programming
- Theorems on the dimensions of convex sets
- Conditions for global optimality. II
- Locally Farkas-Minkowski linear inequality systems
- Locally polyhedral linear inequality systems
- Representability of convex sets by analytical linear inequality systems.
- On the characterization of some families of closed convex sets
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Recent contributions to linear semi-infinite optimization: an update
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- On the stability of the boundary of the feasible set in linear optimization
- An extension of the simplex algorithm for semi-infinite linear programming
- Upper semicontinuity of the feasible set mapping for linear inequality systems
- On the stability of Voronoi cells
- Analytical linear inequality systems and optimization
- On farthest Voronoi cells
- Regularity modulus of arbitrarily perturbed linear inequality systems
- Voronoi cells via linear inequality systems
- On infinite systems of linear inequalities
- Topological stability of linear semi-infinite inequality systems
- Metric regularity of semi-infinite constraint systems
- Robust solutions to multi-objective linear programs with uncertain data
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- Some results on quasipolyhedral convexity
- Simplex-Like Trajectories on Quasi-Polyhedral Sets
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Linear representations and quasipolyhedrality of a finite-valued convex function
- Characterization of Matrix-Exponential Distributions
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- On the Stability of the Extreme Point Set in Linear Optimization
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- On the Subdifferentiability of Convex Functions
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Convex Analysis
- Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity
- On the stability of the feasible set in linear optimization
This page was built for publication: Selected applications of linear semi-infinite systems theory
