On the public citation graph

Generalized semi-infinite optimization: A first order optimality condition and examples

0 signed · 112 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-322-93108-5openalex-snapshot
Numerische Methoden der Approximation und semi-infiniten Optimierung
inferredcites →https://doi.org/10.1007/bf00939841openalex-snapshot
Semi-infinite optimization: Structure and stability of the feasible set
inferredcites →https://doi.org/10.1007/bfb0006502openalex-snapshot
Semi-infinite programming: Conditions of optimality and applications
inferredcites →https://doi.org/10.1016/b978-0-12-590240-3.50009-4openalex-snapshot
Strongly Stable Stationary Solutions in Nonlinear Programs
inferredcites →https://doi.org/10.1023/a:1022650006477openalex-snapshot
Disjunctive Optimization: Critical Point Theory
inferredcites →https://doi.org/10.1080/02331939508844106openalex-snapshot
Second order optimality conditions for generalized semi-infinite programming problems
inferredcites →https://doi.org/10.1109/56.772openalex-snapshot
The acceleration radius: a global performance measure for robotic manipulators
inferredcites →https://doi.org/10.1137/1015073openalex-snapshot
Point-to-Set Maps in Mathematical Programming
inferredcites →https://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferredcites →https://doi.org/10.2307/2004443openalex-snapshot
Introduction to Approximation Theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118445112.stat02391.pub2openalex-snapshot
Semi‐Infinite Programming
inferred← citeshttps://doi.org/10.1002/bdrc.20151openalex-snapshot
A review on data mining and continuous optimization applications in computational biology and medicine
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_39openalex-snapshot
Bilevel Programming: Optimality Conditions and Duality
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_447openalex-snapshot
Semi-Infinite Programming: Second Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/0-387-34221-4_10openalex-snapshot
A semi-infinite approach to design centering
inferred← citeshttps://doi.org/10.1007/3-540-28444-3_22openalex-snapshot
Semi-Infinite Programming: Properties and Applications to Economics
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_3openalex-snapshot
Regularity and Stability in Nonlinear Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_5openalex-snapshot
Exact Penalty Function Methods for Nonlinear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-3403-4_6openalex-snapshot
On Convex Lower Level Problems in Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_213-1openalex-snapshot
Generalized Semi-infinite Programming: Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-3-031-81241-5_21openalex-snapshot
A First-Order Optimality Condition in Nonsmooth Generalized Semi-infinite Programming (GSIP)
inferred← citeshttps://doi.org/10.1007/978-3-319-92775-6_7openalex-snapshot
Semi-infinite Programs with Some Convexity
inferred← citeshttps://doi.org/10.1007/978-3-319-92775-6_8openalex-snapshot
Nonconvex Semi-infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-57592-1_27openalex-snapshot
The Feasible Set in Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_24openalex-snapshot
Trap-Doors in the Solution Set of Semi-Infinite Optimization Problems
inferred← citeshttps://doi.org/10.1007/b130810openalex-snapshot
Nonsmooth Equations in Optimization
inferred← citeshttps://doi.org/10.1007/bf02578994openalex-snapshot
On generalized semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02578997openalex-snapshot
Oliver Stein
inferred← citeshttps://doi.org/10.1007/s00186-020-00724-8openalex-snapshot
A transformation-based discretization method for solving general semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1007/s10100-009-0092-4openalex-snapshot
A survey on OR and mathematical methods applied on gene-environment networks
inferred← citeshttps://doi.org/10.1007/s10107-011-0440-8openalex-snapshot
Subsmooth semi-infinite and infinite optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-012-0591-2openalex-snapshot
Nonlinear robust optimization via sequential convex bilevel programming
inferred← citeshttps://doi.org/10.1007/s10107-013-0672-xopenalex-snapshot
Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
inferred← citeshttps://doi.org/10.1007/s10107-016-1014-6openalex-snapshot
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
inferred← citeshttps://doi.org/10.1007/s10255-004-0179-6openalex-snapshot
The Model for Two-dimensional Layout Optimization Problem with Performance Constraints and Its Optimality Function
inferred← citeshttps://doi.org/10.1007/s10589-005-2179-8openalex-snapshot
On the Use of Augmented Lagrangians in the Solution of Generalized Semi-Infinite Min-Max Problems
inferred← citeshttps://doi.org/10.1007/s10589-012-9489-4openalex-snapshot
A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
inferred← citeshttps://doi.org/10.1007/s10589-015-9810-0openalex-snapshot
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s10589-020-00250-7openalex-snapshot
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization
inferred← citeshttps://doi.org/10.1007/s10666-007-9137-zopenalex-snapshot
A New Mathematical Approach in Environmental and Life Sciences: Gene–Environment Networks and Their Dynamics
inferred← citeshttps://doi.org/10.1007/s10700-004-5569-yopenalex-snapshot
Bilevel Decision with Generalized Semi-infinite Optimization for Fuzzy Mappings as Lower Level Problems
inferred← citeshttps://doi.org/10.1007/s10898-011-9828-5openalex-snapshot
Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s10898-014-0146-6openalex-snapshot
Global optimization of generalized semi-infinite programs via restriction of the right hand side
inferred← citeshttps://doi.org/10.1007/s10898-017-0565-2openalex-snapshot
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
inferred← citeshttps://doi.org/10.1007/s10898-018-0690-6openalex-snapshot
Global optimization of generalized semi-infinite programs using disjunctive programming
inferred← citeshttps://doi.org/10.1007/s10898-019-00764-3openalex-snapshot
Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
inferred← citeshttps://doi.org/10.1007/s10957-008-9352-zopenalex-snapshot
First Order Optimality Conditions for Generalized Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/s10957-009-9621-5openalex-snapshot
Convex Semi-Infinite Programming: Implicit Optimality Criterion Based on the Concept of Immobile Indices
inferred← citeshttps://doi.org/10.1007/s10957-016-0914-1openalex-snapshot
Optimality Conditions for Semi-Infinite and Generalized Semi-Infinite Programs Via Lower Order Exact Penalty Functions
inferred← citeshttps://doi.org/10.1007/s11117-017-0509-6openalex-snapshot
The global weak sharp minima with explicit exponents in polynomial vector optimization problems
inferred← citeshttps://doi.org/10.1007/s11750-008-0052-5openalex-snapshot
Optimization of gene-environment networks in the presence of errors and uncertainty with Chebychev approximation
inferred← citeshttps://doi.org/10.1007/s12532-025-00280-4openalex-snapshot
Polynomial optimization relaxations for generalized semi-infinite programs
inferred← citeshttps://doi.org/10.1007/s12532-026-00308-3openalex-snapshot
libDIPS – discretization-based semi-infinite and bilevel programming solvers
inferred← citeshttps://doi.org/10.1007/s40306-024-00551-7openalex-snapshot
Generalized Semi-infinite Polynomial Optimization and Semidefinite Programming Relaxations
inferred← citeshttps://doi.org/10.1007/s40314-013-0013-yopenalex-snapshot
A smoothing Levenberg–Marquardt method for generalized semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s40314-023-02569-3openalex-snapshot
Optimality and duality analysis for multiobjective interval-valued semi-infinite optimization problem having vanishing constraints
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.108602openalex-snapshot
Backward-forward reachable set splitting for state-constrained differential games
inferred← citeshttps://doi.org/10.1016/j.cam.2007.02.012openalex-snapshot
Generalized semi-infinite programming: A tutorial
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.02.037openalex-snapshot
First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.030openalex-snapshot
On optimization, dynamics and uncertainty: A tutorial for gene-environment networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.08.009openalex-snapshot
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.08.045openalex-snapshot
Semi-infinite programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.12.025openalex-snapshot
Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.06.009openalex-snapshot
How to solve a semi-infinite optimization problem
inferred← citeshttps://doi.org/10.1016/j.epsr.2026.113470openalex-snapshot
Enabling high-rate and wide-coverage communications for smart grid 2.0 via distributed cell-free MISO
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.07.052openalex-snapshot
Global weak sharp minima for convex (semi-)infinite optimization problems
inferred← citeshttps://doi.org/10.1016/j.jprocont.2012.03.008openalex-snapshot
Robust optimization of nonlinear dynamic systems with application to a jacketed tubular reactor
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107324openalex-snapshot
Approximate mixed type duality for semi-infinite programs having equilibrium constraints
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00307-1openalex-snapshot
On generalized semi-infinite optimization and bilevel optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00132-0openalex-snapshot
Generalized semi-infinite programming: Theory and methods
inferred← citeshttps://doi.org/10.1023/a:1004622015901openalex-snapshot
On Optimality Conditions for Generalized Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1023/a:1008245113420openalex-snapshot
A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems
inferred← citeshttps://doi.org/10.1023/a:1010972524021openalex-snapshot
On Linear and Linearized Generalized Semi-Infinite Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1011239607220openalex-snapshot
Second-Order Optimality Conditions in Generalized Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1023/a:1013051931073openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1017588328326openalex-snapshot
An Algorithm Constructing Solutions for a Family of Linear Semi-Infinite Problems
inferred← citeshttps://doi.org/10.1023/a:1021746305759openalex-snapshot
First-Order Optimality Conditions in Generalized Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/01630563.2014.884584openalex-snapshot
Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
inferred← citeshttps://doi.org/10.1080/01630563.2014.895748openalex-snapshot
Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
inferred← citeshttps://doi.org/10.1080/02331930008844493openalex-snapshot
On level sets of marginal functions
inferred← citeshttps://doi.org/10.1080/02331930108844531openalex-snapshot
Generalized semi-infinite programming: numerical aspects
inferred← citeshttps://doi.org/10.1080/02331930108844532openalex-snapshot
Strong duality for inexact linear programming
inferred← citeshttps://doi.org/10.1080/02331930410001661190openalex-snapshot
Solving generalized semi-infinite programs by reduction to simpler problems
inferred← citeshttps://doi.org/10.1080/02331930701780037openalex-snapshot
Mathematical contributions to dynamics and optimization of gene-environment networks
inferred← citeshttps://doi.org/10.1080/02331934.2010.543134openalex-snapshot
General semi-infinite programming: critical point theory
inferred← citeshttps://doi.org/10.1080/02331934.2015.1127370openalex-snapshot
Lower level duality and the global solution of generalized semi-infinite programs
inferred← citeshttps://doi.org/10.1080/02331934.2019.1655739openalex-snapshot
An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
inferred← citeshttps://doi.org/10.1080/02331934.2023.2289026openalex-snapshot
Approximate optimality conditions and duality results for non-smooth semi-infinite programming problems
inferred← citeshttps://doi.org/10.1080/02331939808844398openalex-snapshot
Semi-infinite terminal problems: a newton type method
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701064openalex-snapshot
Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
inferred← citeshttps://doi.org/10.1109/cccm.2008.196openalex-snapshot
Equivalent Reformulations of Generalized Semi-infinite Min-Max Programming
inferred← citeshttps://doi.org/10.1137/060670213openalex-snapshot
Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
inferred← citeshttps://doi.org/10.1137/09076595xopenalex-snapshot
Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
inferred← citeshttps://doi.org/10.1137/16m1139564openalex-snapshot
Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
inferred← citeshttps://doi.org/10.1137/s0363012901398393openalex-snapshot
Solving Semi-Infinite Optimization Problems with Interior Point Techniques
inferred← citeshttps://doi.org/10.1137/s1052623402406777openalex-snapshot
Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
inferred← citeshttps://doi.org/10.1142/s1793557112500544openalex-snapshot
ON FIRST-ORDER NECESSARY CONDITIONS FOR OPTIMALITY OF REGULAR GENERALIZED SEMI-INFINITE PROGRAMMING
inferred← citeshttps://doi.org/10.1155/2013/131938openalex-snapshot
Optimality Conditions for Nonsmooth Generalized Semi-Infinite Programs
inferred← citeshttps://doi.org/10.1186/1029-242x-2014-457openalex-snapshot
A fuzzy semi-infinite optimization problem
inferred← citeshttps://doi.org/10.1287/moor.1060.0234openalex-snapshot
Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
inferred← citeshttps://doi.org/10.1287/moor.26.3.565.10583openalex-snapshot
First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1386/jots.5.3.197_1openalex-snapshot
Environmental and life sciences: gene-environment networks optimization, games and control a survey on recent achievements
inferred← citeshttps://doi.org/10.2298/fil1614649aopenalex-snapshot
Sufficient optimality conditions for semi-infinite multiobjective fractional programming under (Ф,ρ)-V-invexity and generalized (Ф,ρ)-V-invexity
inferred← citeshttps://doi.org/10.23952/asvao.5.2023.1.01openalex-snapshot
Characterization of solution sets of geodesic convex semi-infinite programming on Riemannian manifolds
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.01771openalex-snapshot
Robust Design of Linear Control Laws for Constrained Nonlinear Dynamic Systems
inferred← citeshttps://doi.org/10.3934/jimo.2007.3.357openalex-snapshot
Optimization and dynamics of gene-environment networks with intervals
inferred← citeshttps://doi.org/10.3934/jimo.2009.5.851openalex-snapshot
First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
inferred← citeshttps://doi.org/10.3934/jimo.2017022openalex-snapshot
Non-convex semi-infinite min-max optimization with noncompact sets
inferred← citeshttps://doi.org/10.68381/jca09039openalex-snapshot
On the Topology of Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.7151/dmdico.1059openalex-snapshot
On robustness of set-valued maps and marginal value functions
inferred← citeshttps://doi.org/10.7151/dmgt.1059openalex-snapshot
Long cycles and neighborhood union in 1-tough graphs with large degree sums
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.