On the public citation graph
Semi-infinite programming: Conditions of optimality and applications
0 signed · 117 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/0471787779.ch10openalex-snapshot
Methods of Feasible Directions
inferredcites →https://doi.org/10.1002/nav.3800200310openalex-snapshot
Numerical treatment of a class of semi‐infinite programming problems
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_12openalex-snapshot
Second Order Conditions for Constrained Minima
inferredcites →https://doi.org/10.1007/978-3-0348-5833-5_11openalex-snapshot
Über Minimalbedingungen und Newton-Iteration bei Nichtlinearen Optimierungsaufgaben
inferredcites →https://doi.org/10.1007/bf01419533openalex-snapshot
Kriterien erster und zweiter Ordnung f�r lokal beste Approximationen bei Problemen mit Nebenbedingungen
inferredcites →https://doi.org/10.1007/bf01436923openalex-snapshot
Kriterien zweiter Ordnung f�r lokal beste Approximationen
inferredcites →https://doi.org/10.1007/bf01585500openalex-snapshot
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
inferredcites →https://doi.org/10.1007/bf02165377openalex-snapshot
Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
inferredcites →https://doi.org/10.1007/bfb0087410openalex-snapshot
A newton-method for nonlinear Chebyshev approximation
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1137/0115056openalex-snapshot
Second Order Conditions for Constrained Minima
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms1037openalex-snapshot
Semi‐Infinite Programming
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_382openalex-snapshot
Parametric Global Optimization: Sensitivity
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_438openalex-snapshot
Second Order Constraint Qualifications
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_446openalex-snapshot
Semi-Infinite Programming: Numerical Methods
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/978-0-387-74759-0_47openalex-snapshot
Bilevel Programming: Optimality Conditions and Duality
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_501openalex-snapshot
Parametric Global Optimization: Sensitivity
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_575openalex-snapshot
Second Order Constraint Qualifications
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_588openalex-snapshot
Semi-infinite Programming: Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_589openalex-snapshot
Semi-infinite Programming: Second Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_2openalex-snapshot
On Stability and Deformation in Semi-Infinite Optimization
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_4openalex-snapshot
First and Second Order Optimality Conditions and Perturbation Analysis of Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_7openalex-snapshot
Numerical Methods for Semi-Infinite Programming: A Survey
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-030-54621-2_588-1openalex-snapshot
Semi-infinite Programming: Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_11openalex-snapshot
On Decomposition and Structural Stability in Non-Convex Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-6253-0_12openalex-snapshot
On the Local Structure of the Feasible Set in Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-12583-1_23openalex-snapshot
Multiobjective Semi-infinite Optimization: Convexification and Properly Efficient Points
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_23openalex-snapshot
Branch-and-Bound Reduction Type Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_11openalex-snapshot
A Review of Numerical Methods for Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_5openalex-snapshot
On Regular Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_7openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_7openalex-snapshot
Nonlinear Optimization Problems under Data Perturbations
inferred← citeshttps://doi.org/10.1007/bf00934484openalex-snapshot
Higher-order necessary conditions for infinite and semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/bf01033644openalex-snapshot
On regularity and stability in semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/bf01189030openalex-snapshot
Second-order necessary and sufficient optimality conditions for minimizing a sup-type function
inferred← citeshttps://doi.org/10.1007/bf01442122openalex-snapshot
Farkas-Minkowski systems in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01587092openalex-snapshot
An extension of the simplex algorithm for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf01588788openalex-snapshot
Second order necessary optimality conditions for minimizing a sup-type function
inferred← citeshttps://doi.org/10.1007/bf02055190openalex-snapshot
Suggested research topics in sensitivity and stability analysis for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/bf02055198openalex-snapshot
On parametric nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02578994openalex-snapshot
On generalized semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02591906openalex-snapshot
Optimality conditions for nondifferentiable convex semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02680555openalex-snapshot
Generalized semi-infinite optimization: A first order optimality condition and examples
inferred← citeshttps://doi.org/10.1007/bf02888377openalex-snapshot
Condiciones suficientes para la existencia de solucion optima en un programa semi-infinito
inferred← citeshttps://doi.org/10.1007/bfb0003881openalex-snapshot
Second order necessary optimality conditions for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/bfb0003886openalex-snapshot
On quadratically convergent methods for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0035465openalex-snapshot
Perturbation of stationary solutions in semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/bfb0120922openalex-snapshot
Higher order necessary conditions for an abstract optimization problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0618-zopenalex-snapshot
Metric regularity of semi-infinite constraint systems
inferred← citeshttps://doi.org/10.1007/s10107-007-0167-8openalex-snapshot
No-gap second-order optimality conditions for optimal control problems with a single state constraint and control
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/s101070050095openalex-snapshot
On existence and uniqueness of stationary points in semi-infinite optimization
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-014-9654-zopenalex-snapshot
Solving semi-infinite programs by smoothing projected gradient method
inferred← citeshttps://doi.org/10.1007/s10898-004-8266-zopenalex-snapshot
A Smoothing Newton Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/s10898-007-9232-3openalex-snapshot
Smoothing by mollifiers. Part I: semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/s10898-009-9488-xopenalex-snapshot
On numerical optimization theory of infinite kernel learning
inferred← citeshttps://doi.org/10.1007/s10898-011-9753-7openalex-snapshot
On saddle points in nonconvex semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s10957-004-1838-8openalex-snapshot
Stability of Linear Inequality Systems in a Parametric Setting
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/s10958-009-9608-7openalex-snapshot
Study of a special nonlinear problem arising in convex semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s11590-007-0069-yopenalex-snapshot
Generalized semi-infinite programming: the Symmetric Reduction Ansatz
inferred← citeshttps://doi.org/10.1007/s11750-011-0189-5openalex-snapshot
Implicit optimality criterion for convex SIP problem with box constrained index set
inferred← citeshttps://doi.org/10.1016/0005-1098(92)90055-kopenalex-snapshot
On the computation of reference signal constraints for guaranteed tracking performance
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90384-0openalex-snapshot
Stable local minimizers in semi-infinite optimization: regularity and second-order conditions
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2013.09.003openalex-snapshot
Robust control design of a class of nonlinear input- and state-constrained systems
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.compchemeng.2018.05.025openalex-snapshot
Robust dynamic optimization of batch processes under parametric uncertainty: Utilizing approaches from semi-infinite programs
inferred← citeshttps://doi.org/10.1016/j.crma.2006.09.005openalex-snapshot
Conditions d'optimalité du second ordre nécessaires ou suffisantes pour les problèmes de commande optimale avec une contrainte sur l'état et une commande scalaires
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/s0377-2217(01)00307-1openalex-snapshot
On generalized semi-infinite optimization and bilevel optimization
inferred← citeshttps://doi.org/10.1023/a:1019208524259openalex-snapshot
A Dual Parametrization Method for Convex Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1023/b:reom.0000032109.55408.1aopenalex-snapshot
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory
inferred← citeshttps://doi.org/10.1051/cocv/2013080openalex-snapshot
Second-order sufficient conditions for strong solutions to optimal control problems
inferred← citeshttps://doi.org/10.1063/1.2990909openalex-snapshot
A Hyperbolic Penalty Filter Method for Semi‐Infinite Programming
inferred← citeshttps://doi.org/10.1063/1.3037033openalex-snapshot
Numerical Experiments with a Continuous L[sub 2]-exponential Merit Function for Semi-Infinite Programming
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/02331930008844493openalex-snapshot
On level sets of marginal functions
inferred← citeshttps://doi.org/10.1080/02331930108844532openalex-snapshot
Strong duality for inexact linear programming
inferred← citeshttps://doi.org/10.1080/02331930701764072openalex-snapshot
A reduction method for semi-infinite programming by means of a global stochastic approach†
inferred← citeshttps://doi.org/10.1080/02331934.2011.616894openalex-snapshot
Interior point filter method for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1080/02331934.2017.1282955openalex-snapshot
On duality in multiobjective semi-infinite optimization
inferred← citeshttps://doi.org/10.1080/02331934.2025.2571756openalex-snapshot
Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1080/02331938708843230openalex-snapshot
On sufficient conditions for local optimality in semi-infinite programming
inferred← citeshttps://doi.org/10.1080/02331939208843842openalex-snapshot
An optimality test for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1080/02331939508844106openalex-snapshot
Second order optimality conditions for generalized semi-infinite programming problems
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.1080/10556780500094739openalex-snapshot
An iterative method for solving KKT system of the semi-infinite programming
inferred← citeshttps://doi.org/10.1080/10556780902992803openalex-snapshot
Sufficient optimality conditions for convex semi-infinite programming
inferred← citeshttps://doi.org/10.1080/10556780903483349openalex-snapshot
Infinite kernel learning via infinite and semi-infinite programming
inferred← citeshttps://doi.org/10.1080/10556788.2016.1233974openalex-snapshot
A study of one class of NLP problems arising in parametric semi-infinite programming
inferred← citeshttps://doi.org/10.1109/56.772openalex-snapshot
The acceleration radius: a global performance measure for robotic manipulators
inferred← citeshttps://doi.org/10.1137/060657741openalex-snapshot
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/0805031openalex-snapshot
Local Convergence of SQP Methods in Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/090746331openalex-snapshot
On the Stability of the Feasible Set in Optimization Problems
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/130923452openalex-snapshot
Second-Order Necessary Conditions in Pontryagin Form for Optimal Control Problems
inferred← citeshttps://doi.org/10.1137/s0036139992230296openalex-snapshot
Sensitivity Analysis of Parametrized Programs via Generalized Equations
inferred← citeshttps://doi.org/10.1137/s0363012901398393openalex-snapshot
Solving Semi-Infinite Optimization Problems with Interior Point Techniques
inferred← citeshttps://doi.org/10.1287/moor.10.2.207openalex-snapshot
Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
inferred← citeshttps://doi.org/10.1287/moor.19.3.743openalex-snapshot
On Lipschitzian Stability of Optimal Solutions of Parametrized Semi-Infinite Programs
inferred← citeshttps://doi.org/10.19139/soic.v5i4.362openalex-snapshot
Existence theorem and optimality conditions for a class of convex semi-infinite problems with noncompact index sets
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.4208/jcm.v24.n6.p719openalex-snapshot
On Karush-Kuhn-Tucker Points for a Smoothing Method in Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.5109/13460openalex-snapshot
FIRST- AND SECOND-ORDER DIRECTIONAL DERIVATIVES OF A MAX-TYPE FUNCTION INDUCED FROM AN INEQUALITY STATE CONSTRAINT
inferred← citeshttps://doi.org/10.5802/ojmo.15openalex-snapshot
Frameworks and Results in Distributionally Robust Optimization
inferred← citeshttps://doi.org/10.68381/jca09039openalex-snapshot
On the Topology of Generalized Semi-Infinite Optimization
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.