On the public citation graph
A projected lagrangian algorithm for semi-infinite programming
0 signed · 104 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.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_11openalex-snapshot
A Review of Numerical Methods for Semi-Infinite Optimization
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_16openalex-snapshot
Semi-Infinite Optimization in Engineering Design
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/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01609033openalex-snapshot
A lower bound for the controlling parameters of the exact penalty functions
inferredcites →https://doi.org/10.1007/bf01941472openalex-snapshot
Globally convergent methods for semi-infinite programming
inferredcites →https://doi.org/10.1007/bfb0003885openalex-snapshot
A stable multiple exchange algorithm for linear sip
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.1137/0707026openalex-snapshot
On the Computational Solution of a Class of Generalized Moment Problems
inferredcites →https://doi.org/10.1137/0901025openalex-snapshot
A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
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_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_6openalex-snapshot
Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP
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-642-21931-3_23openalex-snapshot
Branch-and-Bound Reduction Type Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-30504-7_7openalex-snapshot
Multilocal Programming and Applications
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/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/bf01262034openalex-snapshot
Chapter 4 Optimization methods in the case of uncontrolled factors in Hilbert space
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/bf01587092openalex-snapshot
An extension of the simplex algorithm for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1007/bf01933219openalex-snapshot
An exact penalty function algorithm for semi-infinite programmes
inferred← citeshttps://doi.org/10.1007/bf02032162openalex-snapshot
A logarithmic barrier cutting plane method for convex programming
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/bf02564795openalex-snapshot
A multi-local optimization algorithm
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/s00180-007-0106-4openalex-snapshot
The constrained Fisher scoring method for maximum likelihood computation of a nonparametric mixing distribution
inferred← citeshttps://doi.org/10.1007/s00245-008-9060-yopenalex-snapshot
Saddle Points Theory of Two Classes of Augmented Lagrangians and Its Applications to Generalized Semi-infinite Programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0583-6openalex-snapshot
Global solution of semi-infinite programs
inferred← citeshttps://doi.org/10.1007/s10589-005-4556-8openalex-snapshot
Interval Methods for Semi-Infinite Programs
inferred← citeshttps://doi.org/10.1007/s10589-007-9117-xopenalex-snapshot
A smoothing projected Newton-type algorithm for semi-infinite programming
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-006-9077-1openalex-snapshot
A homotopy interior point method for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9462-7openalex-snapshot
A new smoothing Newton-type algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s10957-006-9049-0openalex-snapshot
Global Convergence of a Robust Smoothing SQP Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-025-02807-0openalex-snapshot
A Global Approach for Generalized Semi-Infinite Programs with Polyhedral Parameter Sets
inferred← citeshttps://doi.org/10.1007/s11071-013-0768-0openalex-snapshot
A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1007/s11590-010-0244-4openalex-snapshot
A relaxation method for solving systems with infinitely many linear inequalities
inferred← citeshttps://doi.org/10.1007/s11750-011-0234-4openalex-snapshot
Relaxation methods for solving linear inequality systems: converging results
inferred← citeshttps://doi.org/10.1007/s12532-025-00280-4openalex-snapshot
Polynomial optimization relaxations for generalized semi-infinite programs
inferred← citeshttps://doi.org/10.1016/0141-1195(87)90027-1openalex-snapshot
A search procedure for solving small nonlinear programs on small computers
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90006-xopenalex-snapshot
New descent rules for solving the linear semi-infinite programming problem
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/0377-2217(92)90353-bopenalex-snapshot
A purification algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/0378-3758(94)00119-gopenalex-snapshot
A review of reliable maximum likelihood algorithms for semiparametric mixture models
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.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/s0167-9473(03)00152-xopenalex-snapshot
A parallel algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00042-9openalex-snapshot
On the numerical treatment of linearly constrained semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1016/s0969-6016(97)00018-xopenalex-snapshot
Logarithmic Barrier Decomposition Methods for Semi‐infinite Programming
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54929-0openalex-snapshot
Aspects of Optimization-based CADCS
inferred← citeshttps://doi.org/10.1016/s1570-7946(03)80072-xopenalex-snapshot
Statistical dynamic model building: Applications of semi-infinite programming
inferred← citeshttps://doi.org/10.1016/s1570-7946(04)80161-5openalex-snapshot
Global solution of semi-infinite programs
inferred← citeshttps://doi.org/10.1023/a:1013725219527openalex-snapshot
A Center Cutting Plane Algorithm for a Likelihood Estimate Problem
inferred← citeshttps://doi.org/10.1023/a:1019260508329openalex-snapshot
Computational Discretization Algorithms for Functional Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1023/a:1024814401713openalex-snapshot
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1023/b:anor.0000004764.76984.30openalex-snapshot
Semi-Infinite Programming and Applications to Minimax 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/01621459.1992.10475182openalex-snapshot
An Algorithm for Computing the Nonparametric MLE of a Mixing Distribution
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.611513openalex-snapshot
Rate of convergence of a class of numerical methods solving linear inequality systems
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/02331939208843853openalex-snapshot
A regularized penalty method for solving convex semi-infinite programs
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.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/iccad.1994.629880openalex-snapshot
Synthesis Of Manufacturable Analog Circuits
inferred← citeshttps://doi.org/10.1109/tac.1987.1104455openalex-snapshot
L^{1} -optimal compensators for continuous-time systems
inferred← citeshttps://doi.org/10.1111/j.1467-9868.2007.00583.xopenalex-snapshot
On Fast Computation of the Non-Parametric Maximum Likelihood Estimate of a Mixing Distribution
inferred← citeshttps://doi.org/10.1137/0330023openalex-snapshot
On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
inferred← citeshttps://doi.org/10.1137/060674685openalex-snapshot
Relaxation-Based Bounds for Semi-Infinite Programs
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/090767133openalex-snapshot
A New Exchange Method for Convex Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/21m1431047openalex-snapshot
Convergent Algorithms for a Class of Convex Semi-infinite Programs
inferred← citeshttps://doi.org/10.1137/s0363012994263202openalex-snapshot
A General Stochastic Outer Approximations Method
inferred← citeshttps://doi.org/10.1137/s105262349427621xopenalex-snapshot
An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623498344562openalex-snapshot
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
inferred← citeshttps://doi.org/10.1287/moor.2024.0402openalex-snapshot
Positivstellensätze and Moment Problems with Universal Quantifiers
inferred← citeshttps://doi.org/10.1287/opre.1110.0951openalex-snapshot
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application
inferred← citeshttps://doi.org/10.48550/arxiv.1509.06394openalex-snapshot
Semidefinite programming relaxations for linear semi-infinite polynomial programming
inferred← citeshttps://doi.org/10.5555/191326.191569openalex-snapshot
Synthesis of manufacturable analog circuits
inferred← citeshttps://doi.org/10.70675/6282c58fz0048z4ae3z8b69zfa17dd96c0b9openalex-snapshot
Bilevel optimization and applications
inferred← citeshttps://doi.org/10.70675/6418e724zc0eez447ez84d1z36607157b38dopenalex-snapshot
Global optimization of nonlinear semi-infinite programming problems : Applications in power systems and control.
inferred← citeshttps://doi.org/10.71548/5404openalex-snapshot
IMPLEMENTATION OF AN INTERIOR POINT CUTTING PLANE ALGORITHM
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.