On the public citation graph
Globally convergent methods for semi-infinite programming
0 signed · 55 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/9781118723203openalex-snapshot
Practical Methods of Optimization
inferredcites →https://doi.org/10.1007/978-3-0348-6322-3_12openalex-snapshot
An Algorithm for a Class of Nonlinearly Constrained Nondifferentiable Optimization Problems
inferredcites →https://doi.org/10.1007/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01580395openalex-snapshot
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/bfb0003886openalex-snapshot
On quadratically convergent methods for semi-infinite programming
inferredcites →https://doi.org/10.1007/bfb0003888openalex-snapshot
An approximation method for semi-infinite problems
inferredcites →https://doi.org/10.1007/bfb0067703openalex-snapshot
A fast algorithm for nonlinearly constrained optimization calculations
inferredcites →https://doi.org/10.1007/bfb0094166openalex-snapshot
On the use of exact penalty functions to determine step length in optimization algorithms
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50009-4openalex-snapshot
NUMERICAL EXPERIMENTS WITH AN EXACT L1 PENALTY FUNCTION METHOD
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_446openalex-snapshot
Semi-Infinite Programming: Numerical Methods
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-1-4757-2868-2_5openalex-snapshot
Exact Penalty Function Methods for Nonlinear Semi-Infinite Programming
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_588-1openalex-snapshot
Semi-infinite Programming: Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-3-0348-7186-0_18openalex-snapshot
A Globally Convergent Method for (Constrained) Nonlinear Continuous Ll Approximation Problems
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_10openalex-snapshot
A Three-Phase Algorithm for Semi-Infinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_13openalex-snapshot
Numerical Experiments with Globally Convergent Methods for Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_8openalex-snapshot
Lagrangian Methods for Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_7openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/bf00249645openalex-snapshot
Numerical experiments in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf00940304openalex-snapshot
An interior semi-infinite programming method
inferred← citeshttps://doi.org/10.1007/bf01582053openalex-snapshot
A projected lagrangian algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01933219openalex-snapshot
An exact penalty function algorithm for semi-infinite programmes
inferred← citeshttps://doi.org/10.1007/bf02578953openalex-snapshot
A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02591681openalex-snapshot
An exact penalty function for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0043822openalex-snapshot
Computational complexity of some semiinfinite programming methods
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-006-9077-1openalex-snapshot
A homotopy interior point method for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s11424-011-8427-3openalex-snapshot
Global convergence of a class of smooth penalty methods for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90276-2openalex-snapshot
A globally convergent SQP method for semi-infinite nonlinear optimization
inferred← citeshttps://doi.org/10.1016/b978-0-08-035738-6.50012-4openalex-snapshot
ASPECTS OF OPTIMIZATION-BASED CADCS
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128114openalex-snapshot
Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications
inferred← citeshttps://doi.org/10.1016/j.cam.2009.01.004openalex-snapshot
A nonsmooth Levenberg–Marquardt method for solving semi-infinite programming problems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54929-0openalex-snapshot
Aspects of Optimization-based CADCS
inferred← citeshttps://doi.org/10.1017/s0334270000005270openalex-snapshot
Investigating semi-infinite programs using penalty functions and Lagrangian methods
inferred← citeshttps://doi.org/10.1023/a:1019208524259openalex-snapshot
A Dual Parametrization Method for Convex Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1023/a:1024814401713openalex-snapshot
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1080/00207728708967135openalex-snapshot
ImplementableL∞penalty-function method for semi-infinite optimization
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/10556780310001634091openalex-snapshot
A quasi-Newton interior point method for semi-infinite programming
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/10556788.2012.681659openalex-snapshot
A fast algorithm for the optimal design of high accuracy windows in signal processing
inferred← citeshttps://doi.org/10.1109/9.29441openalex-snapshot
A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
inferred← citeshttps://doi.org/10.1109/tnnls.2013.2291772openalex-snapshot
A Unifying Framework for Typical Multitask Multiple Kernel Learning Problems
inferred← citeshttps://doi.org/10.1109/tnnls.2014.2347054openalex-snapshot
Multitask Classification Hypothesis Space With Improved Generalization Bounds
inferred← citeshttps://doi.org/10.1137/0805031openalex-snapshot
Local Convergence of SQP Methods in Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/0806025openalex-snapshot
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.25439/rmt.27332895openalex-snapshot
New development of the inclusive-cone-based method for linear optimization
inferred← citeshttps://doi.org/10.3182/20090506-3-sf-4003.00008openalex-snapshot
A reduction type penalty algorithm for nonlinear semi-infinite programming
inferred← citeshttps://doi.org/10.3934/jimo.2012.8.705openalex-snapshot
On an exact penalty function method for semi-infinite programming problems
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.