Generalized semi-infinite programming: Theory and methods
From MaRDI portal
Publication:1806731
DOI10.1016/S0377-2217(99)00132-0zbMath0933.90063MaRDI QIDQ1806731
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
numerical methodssemi-infinite programminggeneralized semi-infinite optimization problemsReduction Ansatz
Related Items
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization, The model for two-dimensional layout optimization problem with performance constraints and its optimality function, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions, A smoothing Levenberg-Marquardt method for generalized semi-infinite programming, Frameworks and results in distributionally robust optimization, Semi-infinite programming, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, Equivalent properties of global weak sharp minima with applications, Scenario approximation of robust and chance-constrained programs, On generalized semi-infinite programming. (With comments and rejoinder)., A transformation-based discretization method for solving general semi-infinite optimization problems, How to solve a design centering problem, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Implicit optimality criterion for convex SIP problem with box constrained index set, Bivariate interval semi-infinite programming with an application to environmental decision-making analysis, An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition, Generalized semi-infinite programming: a tutorial, Generalized semi-infinite programming: numerical aspects, Global optimization of generalized semi-infinite programs via restriction of the right hand side, A collision detection approach for maximizing the material utilization, 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, Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity, Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity, ON FIRST-ORDER NECESSARY CONDITIONS FOR OPTIMALITY OF REGULAR GENERALIZED SEMI-INFINITE PROGRAMMING, How to solve a semi-infinite optimization problem, Outer approximation schemes for generalized semi-infinite variational inequality problems, Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems, Optimality conditions for nonsmooth generalized semi-infinite programs, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, Global solution of semi-infinite programs, Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices, Lower level duality and the global solution of generalized semi-infinite programs, Interior point filter method for semi-infinite programming problems, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity, On generalized semi-infinite optimization and bilevel optimization, Equilibrium constrained optimization problems, On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems, Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
Cites Work
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Disjunctive optimization: Critical point theory
- Numerical experiments in semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- On stability and stationary points in nonlinear optimization
- Second order optimality conditions for generalized semi-infinite programming problems
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
