Recent contributions to linear semi-infinite optimization
From MaRDI portal
Publication:1680760
DOI10.1007/S10288-017-0350-6zbMATH Open1374.90392OpenAlexW2751526605MaRDI QIDQ1680760FDOQ1680760
Authors: Miguel Angel Goberna, Marco Antonio López Cerdá 
Publication date: 16 November 2017
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/68975
Recommendations
- Recent contributions to linear semi-infinite optimization: an update
- Linear semi-infinite optimization: recent advances
- scientific article; zbMATH DE number 7753411
- Linear semi-infinite programming theory: an updated survey
- Optimization under uncertainty and linear semi-infinite programming: a survey.
Cites Work
- Projection: A unified approach to semi-infinite linear programs and duality in convex programming
- An Infinite Linear Program with a Duality Gap
- Positive Invariance of Constrained Affine Dynamics and Its Applications to Hybrid Systems and Safety Verification
- Static-arbitrage lower bounds on the prices of basket options via linear programming
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- On implicit active constraints in linear semi-infinite programs with unbounded coefficients
- On the stability of the feasible set in linear optimization
- A successive SDP-NSDP approach to a robust optimization problem in finance
- Mission-based component testing for series systems
- Primal-dual stability in continuous linear optimization
- Optimal value function in semi-infinite programming
- Stability of the duality gap in linear optimization
- Weaker conditions for subdifferential calculus of convex functions
- Penalty and smoothing methods for convex semi-infinite programming
- Some results about the facial geometry of convex semi-infinite systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A relaxation method for solving systems with infinitely many linear inequalities
- Title not available (Why is that?)
- Relaxation methods for solving linear inequality systems: converging results
- Title not available (Why is that?)
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- Stability in linear optimization under perturbations of the left-hand side coefficients
- Title not available (Why is that?)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
- Topological stability of linear semi-infinite inequality systems
- On the 1962-1972 decade of semi-infinite programming: a subjective view.
- Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
- Distance to Solvability/Unsolvability in Linear Optimization
- Ill-posedness with respect to the solvability in linear optimization
- Genericity results in linear conic programming -- a tour d'horizon
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- New approach for the nonlinear programming with transient stability constraints arising from power systems
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Model reduction of uncertain systems retaining the uncertainty structure
- Stability of the primal-dual partition in linear semi-infinite programming
- Numerical treatment of Bayesian robustness problems
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- A fast algorithm for the optimal design of high accuracy windows in signal processing
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- On the Computational Solution of a Class of Generalized Moment Problems
- Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program
- An algorithm for semi-infinite polynomial optimization
- Classifying convex extremum problems over linear topologies having separation properties
- ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- New constraint qualification and optimality for linear semi-infinite programming
- Best approximate solutions of inconsistent linear inequality systems
- A semi-infinite programming approach to two-stage stochastic linear programs with high-order moment constraints
- On error bound moduli for locally Lipschitz and regular functions
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Managing decentralized inventory and transshipment
- Optimality conditions in convex multiobjective SIP
- An exact formula for radius of robust feasibility of uncertain linear programs
- Asymptotic optimality conditions for linear semi-infinite programming
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Linear representations and quasipolyhedrality of a finite-valued convex function
- On solving a class of linear semi-infinite programming by SDP method
- Title not available (Why is that?)
- Outer limits of subdifferentials for min–max type functions
- Stability and continuity in robust optimization
- Duality gap function in infinite dimensional linear programming
- Large scale multiple kernel learning
- SIPAMPL
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Variational Analysis
- Title not available (Why is that?)
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Title not available (Why is that?)
- Robust optimization
- Implicit Functions and Solution Mappings
- Some continuity properties of polyhedral multifunctions
- Infinite dimensional analysis. A hitchhiker's guide.
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Semi-infinite programming
- A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- A shadow simplex method for infinite linear programs
- Essential convexity and complexity of semi-algebraic constraints
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Inequalities for discrete higher order convex functions
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- An extension of the simplex algorithm for semi-infinite linear programming
- Robust solutions to multi-objective linear programs with uncertain data
- Simplex-like trajectories on quasi-polyhedral sets.
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- A ladder method for linear semi-infinite programming
- A New Approach to Lagrange Multipliers
- Linear semi-infinite optimization: recent advances
- Motzkin decomposition of closed convex sets
- Locally Farkas-Minkowski linear inequality systems
- A new exchange method for convex semi-infinite programming
- An iterative method for solving KKT system of the semi-infinite programming
- Calmness modulus of linear semi-infinite programs
- Optimum component test plans for phased-mission systems
- 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
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Calmness modulus of fully perturbed linear programs
- Stability of error bounds for convex constraint systems in Banach spaces
- Title not available (Why is that?)
- Critical objective size and calmness modulus in linear programming
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Calmness of the feasible set mapping for linear inequality systems
- Optimization methods and stability of inclusions in Banach spaces
- Error bounds: necessary and sufficient conditions
- On the sufficiency of finite support duals in semi-infinite linear programming
- Sensitivity analysis in linear semi-infinite programming via partitions
- Stochastic linear programming games with concave preferences
- Constraint qualifications in linear vector semi-infinite optimization
- {\(\Gamma\)}-active constraints in convex semi-infinite programming
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Constraint qualifications in convex vector semi-infinite optimization
- New Farkas-type constraint qualifications in convex infinite programming
- Motzkin decomposition of closed convex sets via truncation
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Knowledge-Based Linear Programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
- Robust linear semi-infinite programming duality under uncertainty
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Title not available (Why is that?)
- Interior-point algorithms for semi-infinite programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
- Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization
- Bivariate interval semi-infinite programming with an application to environmental decision-making analysis
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- Extended Active Constraints in Linear Optimization with Applications
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Stability in linear optimization and related topics. A personal tour
- Isolated calmness of solution mappings in convex semi-infinite optimization
- On metric regularity and the boundary of the feasible set in linear optimization
- Stability Theory for Linear Inequality Systems
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Infinite kernel learning via infinite and semi-infinite programming
- On numerical optimization theory of infinite kernel learning
- Robust static super-replication of barrier options
- Strong approachability
- Numerical treatment of a class of semi‐infinite programming problems
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- Title not available (Why is that?)
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- Extending the mixed algebraic-analysis Fourier-Motzkin elimination method for classifying linear semi-infinite programmes
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Strong duality and sensitivity analysis in semi-infinite linear programming
Cited In (69)
- Title not available (Why is that?)
- Some recent results in parametric semi-infinite programming
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- A stochastic approximation method for convex programming with many semidefinite constraints
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- 4OR comes of age. Editorial note
- On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints
- Preface
- Stability of the feasible set for linear inequality systems: A carrier index set approach
- Solving a class of fuzzy linear programs by using semi-infinite programming techniques
- Numerical treatment of Bayesian robustness problems
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- On solving a class of fractional semi-infinite polynomial programming problems
- The e-support function of an e-convex set and conjugacy for e-convex functions
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- Semi-infinite programming
- Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems
- Inverse eigenvalue problems for linear complementarity systems
- On the stability of closed-convex-valued mappings and the associated boundaries
- A dual characterization of incentive efficiency.
- Motzkin decomposition of closed convex sets
- A sup-function approach to linear semi-infinite optimization
- Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming
- Testing of monotonicity in parametric regression models
- On linear systems containing strict inequalities
- Inverse optimization in semi-infinite linear programs
- Best approximate solutions of inconsistent linear inequality systems
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Model reduction of uncertain systems retaining the uncertainty structure
- Some continuous programming problems in numerical analysis
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Linear semi-infinite programming theory: an updated survey
- Constraint qualifications in convex vector semi-infinite optimization
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Linear semi-infinite optimization: recent advances
- Generalized semi-infinite programming: a tutorial
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- Post-optimal analysis of linear semi-infinite programs
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- On optimization, dynamics and uncertainty: A tutorial for gene-environment networks
- Voronoi cells via linear inequality systems
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On Motzkin decomposable sets and functions
- Stability and augmented Lagrangian duality in nonconvex semi-infinite programming
- An inexact primal-dual algorithm for semi-infinite programming
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Nonsmooth semi-infinite programming problems with mixed constraints
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- On coderivatives and Lipschitzian properties of the dual pair in optimization
- Optimization under uncertainty and linear semi-infinite programming: a survey.
- Characterization of total ill-posedness in linear semi-infinite optimization
- On the equivalence of parametric contexts for linear inequality systems
- Stability of the intersection of solution sets of semi-infinite systems
- Ill-posedness with respect to the solvability in linear optimization
- How to solve a semi-infinite optimization problem
- Clarke coderivatives of efficient point multifunctions in parametric vector optimization
- Optimum component test plans for phased-mission systems
- Nonsmooth multiple-objective optimization in separable Hilbert spaces
- Regularity modulus of arbitrarily perturbed linear inequality systems
- Recent contributions to linear semi-infinite optimization: an update
- Isolated calmness of solution mappings in convex semi-infinite optimization
Uses Software
This page was built for publication: Recent contributions to linear semi-infinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680760)
