Recent contributions to linear semi-infinite optimization: an update
From MaRDI portal
Publication:1730534
DOI10.1007/s10479-018-2987-8zbMath1411.90341OpenAlexW2885558587MaRDI QIDQ1730534
Marco A. López, Miguel Angel Goberna
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/168550
Related Items
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming, Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, Conic linear programming duals for classes of quadratic semi-infinite programs with applications, Marco A. López, a pioneer of continuous optimization in Spain, Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data, An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty, A note on primal-dual stability in infinite linear programming, Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric, On solving a class of fractional semi-infinite polynomial programming problems, The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments, Selected applications of linear semi-infinite systems theory, Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications, Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data, Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus, Distributionally robust inference for extreme value-at-risk, Near-optimal solutions of convex semi-infinite programs via targeted sampling
Uses Software
Cites Work
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- A fast algorithm for the optimal design of high accuracy windows in signal processing
- γ-Active Constraints in Convex Semi-Infinite Programming
- An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs
- Genericity Results in Linear Conic Programming—A Tour d’Horizon
- Static-arbitrage lower bounds on the prices of basket options via linear programming
- A New Exchange Method for Convex Semi-Infinite Programming
- Stability of Error Bounds for Convex Constraint Systems in Banach Spaces
- A Shadow Simplex Method for Infinite Linear Programs
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- Stability of the primal-dual partition in linear semi-infinite programming
- Infinite kernel learning via infinite and semi-infinite programming
- Essential Convexity and Complexity of Semi-Algebraic Constraints
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- An iterative method for solving KKT system of the semi-infinite programming
- Inequalities for discrete higher order convex functions
- Some results about the facial geometry of convex semi-infinite systems
- Linear representations and quasipolyhedrality of a finite-valued convex function
- Implicit Functions and Solution Mappings
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Some continuity properties of polyhedral multifunctions
- A New Approach to Lagrange Multipliers
- Variational Analysis
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Extended Active Constraints in Linear Optimization with Applications
- No-arbitrage bounds for the forward smile given marginals
- Calmness of the Optimal Value in Linear Programming
- Calmness of partially perturbed linear systems with an application to the central path
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Stability Theory for Linear Inequality Systems
- Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program
- Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
- Calmness Modulus of Linear Semi-infinite Programs
- On solving a class of linear semi-infinite programming by SDP method
- Numerical treatment of a class of semi‐infinite programming problems
- Outer limits of subdifferentials for min–max type functions
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
- LP relaxations for a class of linear semi-infinite programming problems
- Knowledge-Based Linear Programming
- An Infinite Linear Program with a Duality Gap
- Positive Invariance of Constrained Affine Dynamics and Its Applications to Hybrid Systems and Safety Verification
- Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- New Farkas-type constraint qualifications in convex infinite programming
- SIPAMPL
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Distance to Solvability/Unsolvability in Linear Optimization
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- On the Computational Solution of a Class of Generalized Moment Problems
- Stability and Continuity in Robust Optimization
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- On the stability of the feasible set in linear optimization
- Duality gap function in infinite dimensional linear programming
- 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
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- The worst-case discounted regret portfolio optimization problem
- Generalized corner optimal solution for LSIP: existence and numerical computation
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Calmness modulus of fully perturbed linear programs
- Stochastic linear programming games with concave preferences
- Constraint qualifications in convex vector semi-infinite optimization
- Robust linear semi-infinite programming duality under uncertainty
- A ladder method for linear semi-infinite programming
- Bivariate interval semi-infinite programming with an application to environmental decision-making analysis
- On metric regularity and the boundary of the feasible set in linear optimization
- Strong approachability
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- Critical objective size and calmness modulus in linear programming
- Strong duality and sensitivity analysis in semi-infinite linear programming
- Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
- Dynamic linear programming games with risk-averse players
- On implicit active constraints in linear semi-infinite programs with unbounded coefficients
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Mission-based component testing for series systems
- Point-based neighborhoods for sharp calmness constants in linear programming
- A relaxation method for solving systems with infinitely many linear inequalities
- On numerical optimization theory of infinite kernel learning
- Calmness of the feasible set mapping for linear inequality systems
- Motzkin decomposition of closed convex sets
- Semi-infinite programming
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Stability in linear optimization under perturbations of the left-hand side coefficients
- Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Primal-dual stability in continuous linear optimization
- Optimization methods and stability of inclusions in Banach spaces
- Numerical treatment of Bayesian robustness problems
- New approach for the nonlinear programming with transient stability constraints arising from power systems
- Error bounds: necessary and sufficient conditions
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Optimal value function in semi-infinite programming
- Farkas-Minkowski systems in semi-infinite programming
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Locally Farkas-Minkowski linear inequality systems
- Interior-point algorithms for semi-infinite programming
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
- Best approximate solutions of inconsistent linear inequality systems
- On the sufficiency of finite support duals in semi-infinite linear programming
- A semi-infinite programming approach to two-stage stochastic linear programs with high-order moment constraints
- Stability of the duality gap in linear optimization
- Recent contributions to linear semi-infinite optimization
- An LP empirical quadrature procedure for parametrized functions
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
- ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- On error bound moduli for locally Lipschitz and regular functions
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- An extension of the simplex algorithm for semi-infinite linear programming
- Classifying convex extremum problems over linear topologies having separation properties
- An algorithm for semi-infinite polynomial optimization
- Motzkin decomposition of closed convex sets via truncation
- Managing decentralized inventory and transshipment
- Stability in linear optimization and related topics. A personal tour
- Relaxation methods for solving linear inequality systems: converging results
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
- Calmness of the argmin mapping in linear semi-infinite optimization
- How to solve a semi-infinite optimization problem
- Constraint qualifications in linear vector semi-infinite optimization
- Robust static super-replication of barrier options
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
- The set of target vectors in a semi-infinite linear program with a duality gap
- Averaging and linear programming in some singularly perturbed problems of optimal control
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Optimality conditions in convex multiobjective SIP
- An exact formula for radius of robust feasibility of uncertain linear programs
- Copositive programming via semi-infinite optimization
- Optimum component test plans for phased-mission systems
- A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
- Ill-posedness with respect to the solvability in linear optimization
- Model reduction of uncertain systems retaining the uncertainty structure
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Isolated calmness of solution mappings in convex semi-infinite optimization
- Topological stability of linear semi-infinite inequality systems
- Robust solutions to multi-objective linear programs with uncertain data
- Weaker conditions for subdifferential calculus of convex functions
- A successive SDP-NSDP approach to a robust optimization problem in finance
- Simplex-Like Trajectories on Quasi-Polyhedral Sets
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- Asymptotic optimality conditions for linear semi-infinite programming
- Some applications of the Semi-Infinite Simplex Algorithm
- Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
