Linear semi-infinite programming theory: an updated survey
From MaRDI portal
Publication:1848390
DOI10.1016/S0377-2217(02)00327-2zbMath1058.90067OpenAlexW2083247753MaRDI QIDQ1848390
Marco A. López, Miguel Angel Goberna
Publication date: 20 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00327-2
StabilityConvex setsWell-posednessConstraint qualificationsParametric optimizationGlobal error boundLinear and convex inequality systemsLinear and convex semi-infinite programming
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (29)
A review of recent advances in global optimization ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ Semi-infinite programming ⋮ Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization ⋮ A NUMERICAL METHOD FOR SOLVING LINEAR–QUADRATIC CONTROL PROBLEMS WITH CONSTRAINTS ⋮ New strong duality results for convex programs with separable constraints ⋮ Necessary optimality conditions for a nonsmooth semi-infinite programming problem ⋮ Relaxation methods for solving linear inequality systems: converging results ⋮ Bivariate interval semi-infinite programming with an application to environmental decision-making analysis ⋮ Semi-infinite interval equilibrium problems: optimality conditions and existence results ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ Unnamed Item ⋮ On metric regularity and the boundary of the feasible set in linear optimization ⋮ On duality theory of convex semi-infinite programming ⋮ Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming ⋮ ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty ⋮ Duality for nonsmooth semi-infinite programming problems ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Understanding linear semi-infinite programming via linear programming over cones ⋮ Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem ⋮ Semi-infinite programming, duality, discretization and optimality conditions† ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ Rate of convergence of a class of numerical methods solving linear inequality systems ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem
Cites Work
- Competitive equilibrium with search frictions: a general equilibrium approach
- Quasipolyhedral sets in linear semiinfinite inequality systems
- Well-posed optimization problems
- Pointwise versions of the maximum theorem with applications in optimization
- Geometric fundamentals of the simplex method in semi-infinite programming
- On the illumination of smooth convex bodies
- A multi-local optimization algorithm
- One-parameter families of feasible sets in semi-infinite optimization
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Combinatorial problems on the illumination of convex bodies
- On feasible sets defined through Chebyshev approximation
- Locally Farkas-Minkowski linear inequality systems
- On closed convex sets without boundary rays and asymptotes
- Semi-infinite optimization: Structure and stability of the feasible set
- Locally polyhedral linear inequality systems
- \(\ell_1\)-minimization with magnitude constraints in the frequency domain
- Asymptotic constraint qualifications and global error bounds for convex inequalities.
- Perturbation analysis of global error bounds for systems of linear inequalities
- On the characterization of some families of closed convex sets
- Recent contributions to linear semi-infinite optimization
- An extension of the simplex algorithm for semi-infinite linear programming
- Stability of the feasible set for linear inequality systems: A carrier index set approach
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- A perturbation method for solving linear semi-infinite programming problems
- Linear programming with fuzzy coefficients in constraints
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- Analytical linear inequality systems and optimization
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Minimal spherical shells and linear semi-infinite optimization.
- Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Strong duality for inexact linear programming
- Semi-infinite linear programming: a unified approach to digital filter design with time- and frequency-domain specifications
- Robust Convex Optimization
- Simplex-Like Trajectories on Quasi-Polyhedral Sets
- Proximal interior point method for convex semi-infinite programming
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Accelerated polynomial approximation of finite order entire functions by growth reduction
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- On extreme points of bounded sets of generalized finite sequence spaces
- On constraint sets of infinite linear programs over ordered fields
- LIMINAL NUMBER OF A CONVEX BODY WITH A SMOOTH BOUNDARY
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- On Linear Semi-Infinite Programming Problems: An Algorithm
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- A dual parameterization approach to linear-quadratic semi-infinite programming problems
- A relaxed cutting plane algorithm for solving fuzzy inequality systems
- Estimation and testing in constrained covariance component models
- A dynamic model for component testing
- Variational Analysis
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Visible Shorelines
- Continuous Convex Sets.
- Methods for Global Prior Robustness under Generalized Moment Conditions
- Semi-infinite transportation problems
- Solving strategies and well-posedness in linear semi-infinite programming
- Stability in linear programming models: An index set approach
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear semi-infinite programming theory: an updated survey
