Recent contributions to linear semi-infinite optimization
From MaRDI portal
Publication:1680760
DOI10.1007/s10288-017-0350-6zbMath1374.90392OpenAlexW2751526605MaRDI QIDQ1680760
Marco A. López, Miguel Angel Goberna
Publication date: 16 November 2017
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/68975
Related Items
A stochastic approximation method for convex programming with many semidefinite constraints ⋮ The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Solving a class of fuzzy linear programs by using semi-infinite programming techniques ⋮ Nonsmooth multiple-objective optimization in separable Hilbert spaces ⋮ Best approximate solutions of inconsistent linear inequality systems ⋮ Motzkin decomposition of closed convex sets ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ Semi-infinite programming ⋮ On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints ⋮ Clarke coderivatives of efficient point multifunctions in parametric vector optimization ⋮ Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients ⋮ Some continuous programming problems in numerical analysis ⋮ Sufficient conditions for total ill-posedness in linear semi-infinite optimization ⋮ Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces ⋮ Inverse optimization in semi-infinite linear programs ⋮ The e-support function of an e-convex set and conjugacy for e-convex functions ⋮ Regularity modulus of arbitrarily perturbed linear inequality systems ⋮ Voronoi cells via linear inequality systems ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials ⋮ A dual characterization of incentive efficiency. ⋮ Stability and augmented Lagrangian duality in nonconvex semi-infinite programming ⋮ On coderivatives and Lipschitzian properties of the dual pair in optimization ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ Characterization of total ill-posedness in linear semi-infinite optimization ⋮ Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming ⋮ Generalized semi-infinite programming: a tutorial ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ On the equivalence of parametric contexts for linear inequality systems ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization ⋮ Optimum component test plans for phased-mission systems ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals ⋮ Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems ⋮ Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems ⋮ Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities ⋮ How to solve a semi-infinite optimization problem ⋮ Numerical treatment of Bayesian robustness problems ⋮ On the stability of closed-convex-valued mappings and the associated boundaries ⋮ Ill-posedness with respect to the solvability in linear optimization ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Inverse eigenvalue problems for linear complementarity systems ⋮ Model reduction of uncertain systems retaining the uncertainty structure ⋮ On Motzkin decomposable sets and functions ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ 4OR comes of age. Editorial note ⋮ Preface ⋮ Nonsmooth semi-infinite programming problems with mixed constraints ⋮ Isolated calmness of solution mappings in convex semi-infinite optimization ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ Pseudo-Lipschitz property of linear semi-infinite vector optimization problems ⋮ Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Analyzing linear systems containing strict inequalities via evenly convex hulls ⋮ Linear semi-infinite programming theory: an updated survey ⋮ Stability of the feasible set for linear inequality systems: A carrier index set approach ⋮ On linear systems containing strict inequalities ⋮ Testing of monotonicity in parametric regression models
Uses Software
Cites Work
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- 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
- 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
- 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
- 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
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
