Bi-level strategies in semi-infinite programming.
From MaRDI portal
Publication:1414363
zbMath1103.90094MaRDI QIDQ1414363
Publication date: 20 November 2003
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
nonsmooth optimizationinterior point methodoptimality conditioncomplementarity constraintsStackelberg gamegeneral semi-infinite programming
Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51) Semi-infinite programming (90C34)
Related Items
Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets ⋮ Foundations of semialgebraic gene-environment networks ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming ⋮ Mathematical programs with equilibrium constraints: the existence of feasible point ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ The cone condition and nonsmoothness in linear generalized Nash games ⋮ Feasible Method for Semi-Infinite Programs ⋮ A homotopy interior point method for semi-infinite programming problems ⋮ On generalized semi-infinite optimization of genetic networks ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Unnamed Item ⋮ Semi-infinite programming ⋮ 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 ⋮ Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ Feasible method for generalized semi-infinite programming ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ A novel non-linear approach to minimal area rectangular packing ⋮ On saddle points in nonconvex semi-infinite programming ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ On Proper Efficiency in Multiobjective Semi-infinite Optimization ⋮ Mathematical contributions to dynamics and optimization of gene-environment networks ⋮ A survey on OR and mathematical methods applied on gene-environment networks ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ Solving bilevel programs with the KKT-approach ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Existence theorems for bilevel problem with applications to mathematical program with equilibrium constraint and semi-infinite problem ⋮ Generalized semi-infinite programming: a tutorial ⋮ Application of general semi-infinite programming to lapidary cutting problems ⋮ The semismooth approach for semi-infinite programming under the reduction ansatz ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ On the closure of the feasible set in generalized semi-infinite programming ⋮ Generalized semi-infinite programming: The symmetric reduction ansatz ⋮ A collision detection approach for maximizing the material utilization ⋮ Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming ⋮ First order optimality conditions for generalized semi-infinite programming problems ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ On smoothness properties of optimal value functions at the boundary of their domain under complete convexity ⋮ Generalized semi-infinite programming: On generic local minimizers ⋮ Augmented lagrangians in semi-infinite programming ⋮ How to solve a semi-infinite optimization problem ⋮ Saddle point problems, bilevel problems, and mathematical program with equilibrium constraint on complete metric spaces ⋮ On constraint qualifications in nonsmooth optimization. ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ Optimality conditions for nonsmooth generalized semi-infinite programs ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Modeling, inference and optimization of regulatory networks based on time series data ⋮ Global solution of semi-infinite programs ⋮ Unnamed Item ⋮ Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems ⋮ Optimization of gene-environment networks in the presence of errors and uncertainty with Chebychev approximation ⋮ Semi-infinite programming, duality, discretization and optimality conditions† ⋮ Existence theorems of quasivariational inclusion problems with applications to bilevel problems and mathematical programs with equilibrium constraint ⋮ Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ The Standard Pessimistic Bilevel Problem ⋮ Lopsided convergence: an extension and its quantification ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ General semi-infinite programming: critical point theory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Equilibrium constrained optimization problems ⋮ Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions ⋮ Interactions Between Bilevel Optimization and Nash Games ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Variational Theory for Optimization under Stochastic Ambiguity ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems ⋮ Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs ⋮ Problem-based optimal scenario generation and reduction in stochastic programming ⋮ On the solution of convex bilevel optimization problems
