Second-order optimality conditions in generalized semi-infinite programming
From MaRDI portal
Publication:5945283
DOI10.1023/A:1011239607220zbMath0984.90056OpenAlexW3093231145MaRDI QIDQ5945283
Jan-Joachim Rückmann, Alexander Shapiro
Publication date: 14 May 2002
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011239607220
second-order optimality conditionsgeneralized semi-infinite optimization problemssecond-order growth condition
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34)
Related Items (24)
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization ⋮ Estimates of generalized hessians for optimal value functions in mathematical programming ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ Second-order optimality conditions in minimax optimization problems ⋮ An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition ⋮ Generalized semi-infinite programming: a tutorial ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem ⋮ On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets ⋮ How to solve a semi-infinite optimization problem ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ Bilevel decision with generalized semi-infinite optimization for fuzzy mappings as lower level problems ⋮ A smoothing Newton method for semi-infinite programming ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Parameter-free duality models and applications to semi-infinite minmax fractional programming based on second-order (\(\phi,\eta ,\rho ,\theta,\tilde{m}\))-sonvexities ⋮ Characterization of strict convexity for locally Lipschitz functions ⋮ Unnamed Item ⋮ Sufficient Optimality Conditions in Bilevel Programming ⋮ Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
This page was built for publication: Second-order optimality conditions in generalized semi-infinite programming
