Semi-infinite programming

DOI10.1016/j.ejor.2006.08.045zbMath1124.90042OpenAlexW2914166403MaRDI QIDQ869581

Georg Still, Marco A. López

Publication date: 8 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.045

zbMATH Keywords

numerical methodsoptimality conditionsapplicationssemi-infinite programminglinear semi-infinite programs

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items

LP relaxations for a class of linear semi-infinite programming problems ⋮ A stochastic approximation method for convex programming with many semidefinite constraints ⋮ Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets ⋮ On equivalent representations and properties of faces of the cone of copositive matrices ⋮ Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function ⋮ Monotone Smoothing Splines using General Linear Systems ⋮ Feasible Method for Semi-Infinite Programs ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Optimality conditions in DC-constrained mathematical programming problems ⋮ Nonlinear set membership filter with state estimation constraints via consensus-ADMM ⋮ The Worst-Case DFT Filter Bank Design with Subchannel Variations ⋮ Prices, profits, proxies, and production ⋮ Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Variational analysis based on proximal subdifferential on smooth Banach spaces ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ Semi-infinite interval equilibrium problems: optimality conditions and existence results ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints ⋮ On nondifferentiable semi-infinite multiobjective programming with interval-valued functions ⋮ A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Optimality, scalarization and duality in linear vector semi-infinite programming ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ Unnamed Item ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ Nonsmooth semi-infinite programming problems with mixed constraints ⋮ Semi-infinite programming, duality, discretization and optimality conditions† ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions ⋮ Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints ⋮ Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods ⋮ Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ Global optimization of semi-infinite programs via restriction of the right-hand side ⋮ Interior point filter method for semi-infinite programming problems ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints ⋮ Slater Condition for Tangent Derivatives ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ SDP reformulation for robust optimization problems based on nonconvex QP duality ⋮ Frameworks and results in distributionally robust optimization ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ Scenario approximation of robust and chance-constrained programs ⋮ Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ Recent contributions to linear semi-infinite optimization ⋮ Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications ⋮ A new exact penalty method for semi-infinite programming problems ⋮ Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems ⋮ Inverse optimization in semi-infinite linear programs ⋮ A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Necessary optimality conditions for a nonsmooth semi-infinite programming problem ⋮ Optimality analysis of a class of semi-infinite programming problems ⋮ Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential ⋮ Bivariate interval semi-infinite programming with an application to environmental decision-making analysis ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ Copositive programming via semi-infinite optimization ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ On highly eccentric cones ⋮ Optimality conditions for nonsmooth semi-infinite multiobjective programming ⋮ On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Generalized semi-infinite programming: a tutorial ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Concentration of the empirical level sets of Tukey's halfspace depth ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ Optimality and duality for multiobjective semi-infinite variational problem using higher-order B-type I functions ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ Extremal bootstrapping: go with the flow ⋮ Multiobjective DC programs with infinite convex constraints ⋮ Cutting ellipses from area-minimizing rectangles ⋮ Duality for nonsmooth semi-infinite programming problems ⋮ How to solve a semi-infinite optimization problem ⋮ Air pollution control with semi-infinite programming ⋮ A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Global convergence of a robust filter SQP algorithm ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ Multi-objective semi-infinite variational problem and generalized invexity ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem ⋮ A dynamic game approach to distributionally robust safety specifications for stochastic systems ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ Ergodic approach to robust optimization and infinite programming problems ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints ⋮ Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ A new complementarity function and applications in stochastic second-order cone complementarity problems ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Pareto solutions in multicriteria optimization under uncertainty ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming ⋮ Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms ⋮ Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem

Uses Software

• SIPAMPL

Cites Work

• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• Optimal value function in semi-infinite programming
• An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems
• The limiting Lagrangian as a consequence of Helly's theorem
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Practical bilevel optimization. Algorithms and applications
• Locally Farkas-Minkowski linear inequality systems
• Robust solutions of uncertain linear programs
• Optimization. Algorithms and consistent approximations
• Bi-level strategies in semi-infinite programming.
• A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
• On optimality conditions for generalized semi-infinite programming problems
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• Recent contributions to linear semi-infinite optimization
• Generalized semi-infinite programming: Theory and methods
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• On generalized semi-infinite optimization and bilevel optimization
• Linear semi-infinite programming theory: an updated survey
• Upper semicontinuity of the feasible set mapping for linear inequality systems
• Locally Farkas-Minkowski systems in convex semi-infinite programming
• Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
• Topological stability of linear semi-infinite inequality systems
• Equilibrium constrained optimization problems
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• Strong duality for inexact linear programming
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• Semi-Infinite Programming: Theory, Methods, and Applications
• Moments of non-negative mass
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Cutting plane algorithms for robust conic convex optimization problems
• Connections between generalized, inexact and semi-infinite linear programming
• Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
• An implementation of a discretization method for semi-infinite programming
• Kuhn-Tucker curves for one-parametric semi-infinite programming
• Optimization Problems with Perturbations: A Guided Tour
• Sensitivity Analysis of Parametrized Programs via Generalized Equations
• On Lipschitzian Stability of Optimal Solutions of Parametrized Semi-Infinite Programs
• On the numerical treatment of a class of semi-infinite terminal problems^∗∗Partially supported by the german research society (DFG)$ef:
• Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
• On Generic One-Parametric Semi-Infinite Optimization
• Approximation theory methods for solving elliptic eigenvalue problems
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems
• About stability of equilibrium shapes
• Stability and Well-Posedness in Linear Semi-Infinite Programming
• Stability Theory for Linear Inequality Systems
• On sufficient conditions for local optimality in semi-infinite programming
• Second order optimality conditions for generalized semi-infinite programming problems
• Numerical treatment of a class of semi‐infinite programming problems
• SIPAMPL
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
• Mathematical Programs with Equilibrium Constraints
• Solving strategies and well-posedness in linear semi-infinite programming
• Discretization in semi-infinite programming: the rate of convergence
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item