Pages that link to "Item:Q5945283"
From MaRDI portal
The following pages link to Second-order optimality conditions in generalized semi-infinite programming (Q5945283):
Displaying 24 items.
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem (Q494875) (← links)
- On generalized semi-infinite programming. (With comments and rejoinder). (Q874881) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- New approach for the nonlinear programming with transient stability constraints arising from power systems (Q967215) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems (Q976438) (← links)
- Characterization of strict convexity for locally Lipschitz functions (Q1047553) (← links)
- Bilevel decision with generalized semi-infinite optimization for fuzzy mappings as lower level problems (Q1774610) (← links)
- A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
- Parameter-free duality models and applications to semi-infinite minmax fractional programming based on second-order (\(\phi,\eta ,\rho ,\theta,\tilde{m}\))-sonvexities (Q1790406) (← links)
- A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization (Q1877015) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- Second-order optimality conditions in minimax optimization problems (Q1949567) (← links)
- Estimates of generalized hessians for optimal value functions in mathematical programming (Q2158824) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming (Q2406534) (← links)
- A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems (Q2877727) (← links)
- Sufficient Optimality Conditions in Bilevel Programming (Q5026452) (← links)
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition (Q5131821) (← links)
- (Q5158545) (← links)
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets (Q5413872) (← links)