On the public citation graph

An exact penalty function for semi-infinite programming

https://doi.org/10.1007/bf02591681
0 signed · 59 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-642-46477-5openalex-snapshot
Semi-Infinite Programming and Applications
inferredcites →https://doi.org/10.1007/978-3-642-46477-5_10openalex-snapshot
A Three-Phase Algorithm for Semi-Infinite Programs
inferredcites →https://doi.org/10.1007/978-3-642-46477-5_13openalex-snapshot
Numerical Experiments with Globally Convergent Methods for Semi-Infinite Programming Problems
inferredcites →https://doi.org/10.1007/978-3-642-46477-5_2openalex-snapshot
Semi-Infinite Programming Duality: How Special is It?
inferredcites →https://doi.org/10.1007/978-3-642-46477-5_9openalex-snapshot
Globalization of Locally Convergent Algorithms for Nonlinear Optimization Problems with Constraints
inferredcites →https://doi.org/10.1007/bf01582053openalex-snapshot
A projected lagrangian algorithm for semi-infinite programming
inferredcites →https://doi.org/10.1007/bf01941472openalex-snapshot
Globally convergent methods for semi-infinite programming
inferredcites →https://doi.org/10.1007/bf02165588openalex-snapshot
The potential method for conditional maxima in the locally compact metric spaces
inferredcites →https://doi.org/10.1007/bf02592223openalex-snapshot
A note on the computation of an orthonormal basis for the null space of a matrix
inferredcites →https://doi.org/10.1007/bfb0003886openalex-snapshot
On quadratically convergent methods for semi-infinite programming
inferredcites →https://doi.org/10.1016/0041-5553(69)90086-xopenalex-snapshot
Approximate reduction of the problem of determining a maximin to the problem of determining a maximum by means of penalty functions
inferredcites →https://doi.org/10.1016/0377-2217(82)90093-5openalex-snapshot
Practical optimization
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1137/0706028openalex-snapshot
An Exact Potential Method for Constrained Maxima
inferredcites →https://doi.org/10.1137/0714022openalex-snapshot
A Penalty Function Method Converging Directly to a Constrained Optimum
inferredcites →https://doi.org/10.1364/josa.51.000248openalex-snapshot
Soviet Physics—Doklady
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/2310749openalex-snapshot
Mathematical Analysis.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/aic.17857openalex-snapshot
Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_443openalex-snapshot
Semi-infinite programming and control problems; Semi-infinite programming: Discretization methods; Semi-infinite programming: Methods for linear problems; Semi-infinite programming: Numerical methods; Semi-infinite programming: Second order optimality conditions; Semi-infinite programming,…
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_584openalex-snapshot
Semi-infinite Programming: Approximation 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-4615-3600-0_28openalex-snapshot
Semi-Infinite Programming: Recent Trends of Development
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/bf00249645openalex-snapshot
Numerical experiments in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf01445158openalex-snapshot
Global convergence of a semi-infinite optimization method
inferred← citeshttps://doi.org/10.1007/bf01585730openalex-snapshot
A one-phase algorithm for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf01586049openalex-snapshot
A barrier function method for minimax problems
inferred← citeshttps://doi.org/10.1007/bf01933219openalex-snapshot
An exact penalty function algorithm for semi-infinite programmes
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/bf02875980openalex-snapshot
The stability of the maximum entropy method for nonsmooth semi-infinite programmings
inferred← citeshttps://doi.org/10.1007/s00186-013-0440-yopenalex-snapshot
On the convergence of a smoothed penalty algorithm 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/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.1016/0377-0427(88)90276-2openalex-snapshot
A globally convergent SQP method for semi-infinite nonlinear optimization
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90010-0openalex-snapshot
A comparative study of several semi-infinite nonlinear programming algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.01.026openalex-snapshot
A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.08.045openalex-snapshot
Solving air traffic conflict problems via local continuous optimization
inferred← citeshttps://doi.org/10.1023/a:1024814401713openalex-snapshot
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1080/02331934.2021.1906872openalex-snapshot
Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function
inferred← citeshttps://doi.org/10.1080/02331939008843600openalex-snapshot
Exact penalty functions in single-stage stochastic programming 1
inferred← citeshttps://doi.org/10.1109/43.736569openalex-snapshot
JiffyTune: circuit optimization using time-domain sensitivities
inferred← citeshttps://doi.org/10.1109/43.848089openalex-snapshot
Noise considerations in circuit optimization
inferred← citeshttps://doi.org/10.1109/tro.2024.3391649openalex-snapshot
Provably Feasible Semi-Infinite Program Under Collision Constraints via Subdivision
inferred← citeshttps://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/s105262349427621xopenalex-snapshot
An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1145/288548.288617openalex-snapshot
Noise considerations in circuit optimization
inferred← citeshttps://doi.org/10.1155/2012/145083openalex-snapshot
An Augmented Lagrangian Algorithm for Solving SemiinfiniteProgramming
inferred← citeshttps://doi.org/10.1155/2013/245485openalex-snapshot
Variational Inequalities and Vector Optimization
inferred← citeshttps://doi.org/10.23919/acc.1992.4792609openalex-snapshot
Worst-Case Scheduled Controller Design for Nonlinear Systems
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
inferred← citeshttps://doi.org/10.3934/jimo.2022196openalex-snapshot
On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
inferred← citeshttps://doi.org/10.3934/naco.2021057openalex-snapshot
Distributionally Robust Optimization: A review on theory and applications
inferred← citeshttps://doi.org/10.46281/afbr.v3i1.317openalex-snapshot
L1 Norm Based Data Analysis and Related Methods
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.