Generalized semi-infinite programming: Theory and methods
From MaRDI portal
Recommendations
Cites work
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Convex Analysis
- Disjunctive optimization: Critical point theory
- Generalized semi-infinite optimization: A first order optimality condition and examples
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 16989 (Why is no real title available?)
- scientific article; zbMATH DE number 1047616 (Why is no real title available?)
- Numerical experiments in semi-infinite programming
- On stability and stationary points in nonlinear optimization
- Second order optimality conditions for generalized semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
Cited in
(55)- Global solution of semi-infinite programs
- On generalized semi-infinite optimization and bilevel optimization
- 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 lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Implicit optimality criterion for convex SIP problem with box constrained index set
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Frameworks and results in distributionally robust optimization
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- How to solve a semi-infinite optimization problem
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- How to solve a design centering problem
- Equilibrium constrained optimization problems
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Generalized semi-infinite programming: numerical aspects
- The feasible set in generalized semi-infinite optimization
- Lower level duality and the global solution of generalized semi-infinite programs
- Generalized corner optimal solution for LSIP: existence and numerical computation
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- Interior point filter method for semi-infinite programming problems
- General semi-infinite programming: critical point theory
- Semi-Infinite Programming: Theory, Methods, and Applications
- Connections between generalized, inexact and semi-infinite linear programming
- scientific article; zbMATH DE number 4170652 (Why is no real title available?)
- Outer approximation schemes for generalized semi-infinite variational inequality problems
- Equivalent properties of global weak sharp minima with applications
- Scenario approximation of robust and chance-constrained programs
- Bivariate interval semi-infinite programming with an application to environmental decision-making analysis
- scientific article; zbMATH DE number 1994002 (Why is no real title available?)
- Solving generalized semi-infinite programs by reduction to simpler problems
- Some recent results in parametric semi-infinite programming
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- On first-order necessary conditions for optimality of regular generalized semi-infinite programming
- 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
- Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Robust bilevel optimization for near-optimal lower-level solutions
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Polynomial optimization relaxations for generalized semi-infinite programs
- Optimizing flexibility in power systems by maximizing the region of manageable uncertainties
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Semi-infinite programming
- On generalized semi-infinite programming. (With comments and rejoinder).
- Generalized semi-infinite programming: a tutorial
- Application of general semi-infinite programming to lapidary cutting problems
- Generalized semi-infinite programming: The symmetric reduction ansatz
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
This page was built for publication: Generalized semi-infinite programming: Theory and methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806731)
