On the public citation graph
A robust sequential quadratic programming method
0 signed · 156 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-0348-0439-4_9openalex-snapshot
Extremum Problems with Inequalities as Subsidiary Conditions
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-95406-1_20openalex-snapshot
Nonlinear Programming Methods with Linear Least Squares Subproblems
inferredcites →https://doi.org/10.1007/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01395810openalex-snapshot
The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function
inferredcites →https://doi.org/10.1007/bf01580366openalex-snapshot
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
inferredcites →https://doi.org/10.1007/bf01580395openalex-snapshot
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/bf01584377openalex-snapshot
Descent methods for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
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/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588302openalex-snapshot
On conditions to have bounded multipliers in locally lipschitz programming
inferredcites →https://doi.org/10.1007/bf01588967openalex-snapshot
Algorithms for nonlinear constraints that use lagrangian functions
inferredcites →https://doi.org/10.1007/bf01593777openalex-snapshot
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex 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/bf02592073openalex-snapshot
Projected gradient methods for linearly constrained problems
inferredcites →https://doi.org/10.1007/bfb0067703openalex-snapshot
A fast algorithm for nonlinearly constrained optimization calculations
inferredcites →https://doi.org/10.1007/bfb0093151openalex-snapshot
Second order corrections for non-differentiable optimization
inferredcites →https://doi.org/10.1007/bfb0120959openalex-snapshot
A model algorithm for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1070/rm1973v028n06abeh001624openalex-snapshot
APPROXIMATIVE PROPERTIES OF SETS IN NORMED LINEAR SPACES
inferredcites →https://doi.org/10.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.11.4.632openalex-snapshot
A Gauss-Newton Approach to Solving Generalized Inequalities
inferredcites →https://doi.org/10.2307/3008352openalex-snapshot
Numerical Methods for Non-Linear Optimization
inferredcites →https://doi.org/10.2307/3323470openalex-snapshot
Lecture Notes in Economics and Mathematical Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.5353openalex-snapshot
On sequential approximate simultaneous analysis and design in classical topology optimization
inferred← citeshttps://doi.org/10.1002/oca.838openalex-snapshot
Direct optimization of dynamic systems described by differential‐algebraic equations
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_6openalex-snapshot
Sequential Quadratic Programming Methods
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-642-38398-4_8openalex-snapshot
Optimization Viewpoint on Kalman Smoothing with Applications to Robust and Sparse Estimation
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf00939376openalex-snapshot
Equality and inequality constrained optimization algorithms with convergent stepsizes
inferred← citeshttps://doi.org/10.1007/bf00940552openalex-snapshot
Analysis and implementation of a dual algorithm for constrained optimization
inferred← citeshttps://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferred← citeshttps://doi.org/10.1007/bf01198402openalex-snapshot
A new technique for inconsistent QP problems in the SQP method
inferred← citeshttps://doi.org/10.1007/bf01580617openalex-snapshot
NE/SQP: A robust algorithm for the nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02014586openalex-snapshot
A new successive quadratic programming algorithm
inferred← citeshttps://doi.org/10.1007/bf02874433openalex-snapshot
New sequential quadratic programming algorithm with consistent subproblems
inferred← citeshttps://doi.org/10.1007/bf02876059openalex-snapshot
An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
inferred← citeshttps://doi.org/10.1007/s00158-012-0799-zopenalex-snapshot
Multivariable crashworthiness optimization of vehicle body by unreplicated saturated factorial design
inferred← citeshttps://doi.org/10.1007/s00158-020-02662-9openalex-snapshot
Optimization design of highway cable barriers based on collision safety consideration
inferred← citeshttps://doi.org/10.1007/s002110050133openalex-snapshot
On the convergence of a new trust region algorithm
inferred← citeshttps://doi.org/10.1007/s002459911015openalex-snapshot
A Variant of the Topkis--Veinott Method for Solving Inequality Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00366-022-01692-9openalex-snapshot
An efficient hierarchical fuzzy simulation method for estimating failure possibility
inferred← citeshttps://doi.org/10.1007/s10107-005-0701-5openalex-snapshot
Interior-point ℓ2-penalty methods for nonlinear programming with strong global convergence properties
inferred← citeshttps://doi.org/10.1007/s10107-009-0272-yopenalex-snapshot
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
inferred← citeshttps://doi.org/10.1007/s10107-010-0408-0openalex-snapshot
A line search exact penalty method using steering rules
inferred← citeshttps://doi.org/10.1007/s10107-024-02057-4openalex-snapshot
Level constrained first order methods for function constrained optimization
inferred← citeshttps://doi.org/10.1007/s102550200005openalex-snapshot
A SQP Method for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s10589-005-3075-yopenalex-snapshot
A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10589-005-3230-5openalex-snapshot
A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10589-014-9675-7openalex-snapshot
Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
inferred← citeshttps://doi.org/10.1007/s10589-017-9963-0openalex-snapshot
Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
inferred← citeshttps://doi.org/10.1007/s10589-026-00787-zopenalex-snapshot
A natural SQP method with potentially infeasible subproblems for nonlinear optimization
inferred← citeshttps://doi.org/10.1007/s10898-007-9219-0openalex-snapshot
A globally and superlinearly convergent modified SQP-filter method
inferred← citeshttps://doi.org/10.1007/s10957-025-02747-9openalex-snapshot
On Detecting Degenerate Stationarity
inferred← citeshttps://doi.org/10.1007/s11012-022-01623-4openalex-snapshot
Dynamics and phase coordination of multi-module vibration-driven locomotion robots with linear or nonlinear connections
inferred← citeshttps://doi.org/10.1007/s11766-007-0407-yopenalex-snapshot
A smoothing QP-free infeasible method for nonlinear inequality constrained optimization
inferred← citeshttps://doi.org/10.1007/s12190-010-0386-7openalex-snapshot
A kind of nonmonotone filter method for nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/s12190-012-0549-9openalex-snapshot
A feasible filter SQP algorithm with global and local convergence
inferred← citeshttps://doi.org/10.1007/s12190-020-01359-yopenalex-snapshot
A Sequential Quadratic Programming Method for Constrained Multi-objective Optimization Problems
inferred← citeshttps://doi.org/10.1007/s12532-025-00295-xopenalex-snapshot
A penalty-free method with nonmonotone line search for nonlinear optimization
inferred← citeshttps://doi.org/10.1007/s40305-025-00592-1openalex-snapshot
Exact Penalty Method for D-stationary Point of Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/s40314-015-0291-7openalex-snapshot
On the augmented subproblems within sequential methods for nonlinear programming
inferred← citeshttps://doi.org/10.1016/0045-7825(95)00852-8openalex-snapshot
On the numerical modeling of convex particle assemblies with friction
inferred← citeshttps://doi.org/10.1016/0045-7949(95)00362-2openalex-snapshot
On the numerical modelling of convex particle assemblies
inferred← citeshttps://doi.org/10.1016/b978-0-12-012736-8.50007-3openalex-snapshot
Methods for Optimal Economic Policy Design
inferred← citeshttps://doi.org/10.1016/j.amc.2006.08.034openalex-snapshot
A modified SQP method and its global convergence
inferred← citeshttps://doi.org/10.1016/j.amc.2007.04.014openalex-snapshot
A modified SQP-filter method and its global convergence
inferred← citeshttps://doi.org/10.1016/j.amc.2012.12.002openalex-snapshot
A restoration-free filter SQP algorithm for equality constrained optimization
inferred← citeshttps://doi.org/10.1016/j.apm.2021.06.010openalex-snapshot
A decoupling approach for time-dependent robust optimization with application to power semiconductor devices
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.05.029openalex-snapshot
An inequality constrained nonlinear Kalman–Bucy smoother by interior point likelihood maximization
inferred← citeshttps://doi.org/10.1016/j.cam.2004.10.012openalex-snapshot
Global convergence on an active set SQP for inequality constrained optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2005.11.004openalex-snapshot
A variant of SQP method for inequality constrained optimization and its global convergence
inferred← citeshttps://doi.org/10.1016/j.cam.2008.07.017openalex-snapshot
A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.05.030openalex-snapshot
A modified SQP method with nonmonotone technique and its global convergence
inferred← citeshttps://doi.org/10.1016/j.camwa.2012.01.002openalex-snapshot
A trust region SQP-filter method for nonlinear second-order cone programming
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2008.02.010openalex-snapshot
MPEC problem formulations and solution strategies with chemical engineering applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.02.031openalex-snapshot
Global convergence of a robust filter SQP algorithm
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110630openalex-snapshot
Bayesian Co-evolutionary Optimization based entropy search for high-dimensional many-objective optimization
inferred← citeshttps://doi.org/10.1016/j.orl.2014.12.013openalex-snapshot
A new result on second-order necessary conditions for nonlinear programming
inferred← citeshttps://doi.org/10.1016/j.ress.2023.109810openalex-snapshot
A novel quantile-based sequential optimization and reliability assessment method for safety life analysis
inferred← citeshttps://doi.org/10.1016/j.rser.2025.116122openalex-snapshot
Towards high-performance fuel cell systems: Comprehensive review of methods for modeling, control, and optimization
inferred← citeshttps://doi.org/10.1016/s0098-1354(98)00231-2openalex-snapshot
A new treatment of inconsistent quadratic programs in a SQP-based algorithm
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80131-2openalex-snapshot
7 Mathematical programming — A computational perspective
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90002-2openalex-snapshot
Globally and superlinearly convergent algorithms for the solution of box-constrained optimization
inferred← citeshttps://doi.org/10.1023/a:1008255227457openalex-snapshot
A Modified SQP Method and Its Global Convergence
inferred← citeshttps://doi.org/10.1023/a:1011281102385openalex-snapshot
The Algorithm of Sequential KKT Equations by Nonmonotone Search for Arbitrary Initial Point
inferred← citeshttps://doi.org/10.1023/a:1011942228555openalex-snapshot
A Modified SQP Method with Nonmonotone Linesearch Technique
inferred← citeshttps://doi.org/10.1023/a:1011983130559openalex-snapshot
A Globally and Superlinearly Convergent SQP Algorithm for Nonlinear Constrained Optimization
inferred← citeshttps://doi.org/10.1023/a:1014882909302openalex-snapshot
Globally and Superlinearly Convergent QP-Free Algorithm for Nonlinear Constrained Optimization
inferred← citeshttps://doi.org/10.1023/a:1017565922109openalex-snapshot
Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming
inferred← citeshttps://doi.org/10.1023/a:1022655423083openalex-snapshot
Robust Recursive Quadratic Programming Algorithm Model with Global and Superlinear Convergence Properties
inferred← citeshttps://doi.org/10.1023/b:jota.0000004875.49572.10openalex-snapshot
Sequential Penalty Algorithm for Nonlinear Constrained Optimization
inferred← citeshttps://doi.org/10.1080/00207160.2016.1154947openalex-snapshot
An infeasible active-set QP-free algorithm for general nonlinear programming
inferred← citeshttps://doi.org/10.1080/02331930701761193openalex-snapshot
A robust SQP method based on a smoothing lower order penalty function†
inferred← citeshttps://doi.org/10.1080/02331934.2020.1827406openalex-snapshot
A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
inferred← citeshttps://doi.org/10.1080/02331934.2024.2345397openalex-snapshot
A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1080/10556788.2013.858156openalex-snapshot
An interior point method for nonlinear programming with infeasibility detection capabilities
inferred← citeshttps://doi.org/10.1080/10556788.2016.1177528openalex-snapshot
Some new facts about sequential quadratic programming methods employing second derivatives
inferred← citeshttps://doi.org/10.1090/mcom/3799openalex-snapshot
A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
inferred← citeshttps://doi.org/10.1093/imanum/drag073openalex-snapshot
A sequential quadratic programming method for optimization with expectation objective functions, deterministic inequality constraints and robust subproblems
inferred← citeshttps://doi.org/10.1093/imanum/drag082openalex-snapshot
A penalty-free line search method for inequality constrained optimization with infeasibility detection
inferred← citeshttps://doi.org/10.1093/imanum/drq037openalex-snapshot
A sequential quadratic programming algorithm with an additional equality constrained phase
inferred← citeshttps://doi.org/10.1109/bife.2013.126openalex-snapshot
An SQP Algorithm with Flexible Penalty Functions
inferred← citeshttps://doi.org/10.1109/cdc.1989.70138openalex-snapshot
Dual techniques for constrained optimization. II
inferred← citeshttps://doi.org/10.1109/cso.2011.41openalex-snapshot
A Modified Penalty-Free-Type Nonmonotone SQP Method
inferred← citeshttps://doi.org/10.1109/cso.2011.42openalex-snapshot
A Modified Sequence Quadratic Programming Method for Nonlinear Programming
inferred← citeshttps://doi.org/10.1109/cso.2012.93openalex-snapshot
A Modified SQP Method for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1109/ei250167.2020.9346740openalex-snapshot
Robust Optimal Dispatch of Power Grid Considering Wind/PV Power Uncertainties
inferred← citeshttps://doi.org/10.1109/icamechs.2013.6681743openalex-snapshot
Flexible penalty functions for SQP algorithm with additional equality constrained phase
inferred← citeshttps://doi.org/10.1109/iros.2010.5654354openalex-snapshot
The unconstrained and inequality constrained moving horizon approach to robot localization
inferred← citeshttps://doi.org/10.1111/exsy.13705openalex-snapshot
Trust region based chaotic search for solving multi‐objective optimization problems
inferred← citeshttps://doi.org/10.1137/0725068openalex-snapshot
On the Identification of Active Constraints
inferred← citeshttps://doi.org/10.1137/0727064openalex-snapshot
On the Identification of Active Constraints II: The Nonconvex Case
inferred← citeshttps://doi.org/10.1137/0802016openalex-snapshot
A Robust Trust Region Method for Constrained Nonlinear Programming Problems
inferred← citeshttps://doi.org/10.1137/0802027openalex-snapshot
New Results on a Continuously Differentiable Exact Penalty Function
inferred← citeshttps://doi.org/10.1137/0804050openalex-snapshot
Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations
inferred← citeshttps://doi.org/10.1137/0805030openalex-snapshot
A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
inferred← citeshttps://doi.org/10.1137/080739884openalex-snapshot
A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
inferred← citeshttps://doi.org/10.1137/120880045openalex-snapshot
A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
inferred← citeshttps://doi.org/10.1137/130912190openalex-snapshot
An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming
inferred← citeshttps://doi.org/10.1137/140971580openalex-snapshot
Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
inferred← citeshttps://doi.org/10.1137/16m1068256openalex-snapshot
Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems
inferred← citeshttps://doi.org/10.1137/18m1176488openalex-snapshot
Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver
inferred← citeshttps://doi.org/10.1137/20m1370173openalex-snapshot
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds
inferred← citeshttps://doi.org/10.1137/22m1490995openalex-snapshot
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
inferred← citeshttps://doi.org/10.1137/s1052623401383881openalex-snapshot
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1137/s1052623402400641openalex-snapshot
A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
inferred← citeshttps://doi.org/10.1137/s1052623402401221openalex-snapshot
On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1137/s1052623497321894openalex-snapshot
An Augmented Lagrangian Function with Improved Exactness Properties
inferred← citeshttps://doi.org/10.1137/s1052623497332329openalex-snapshot
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
inferred← citeshttps://doi.org/10.1137/s1064827598334861openalex-snapshot
A Robust Algorithm for Optimization with General Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.1140/epjs/s11734-021-00084-2openalex-snapshot
Estimation of rheological parameters for unstained living cells
inferred← citeshttps://doi.org/10.1155/2013/524539openalex-snapshot
A Globally Convergent Line Search Filter SQP Method for Inequality Constrained Optimization
inferred← citeshttps://doi.org/10.1155/2014/158780openalex-snapshot
Error Bounds and Finite Termination for Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1186/s13660-019-2171-yopenalex-snapshot
A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.12677/aam.2018.74056openalex-snapshot
A New Globally Convergent Algorithm for Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.2015.0735openalex-snapshot
Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
inferred← citeshttps://doi.org/10.1287/moor.2020.1079openalex-snapshot
Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
inferred← citeshttps://doi.org/10.1360/012011-1037openalex-snapshot
How does the linear independence assumption affect algorithms of nonlinear constrained optimization
inferred← citeshttps://doi.org/10.1360/ssm-2024-0132openalex-snapshot
Interior-point augmented Lagrangian methods for constrained optimization
inferred← citeshttps://doi.org/10.15495/epub_ubt_00005600openalex-snapshot
Set-Valued Numerical Analysis and Optimal Control
inferred← citeshttps://doi.org/10.1590/s1807-03022009000200003openalex-snapshot
A filter SQP algorithm without a feasibility restoration phase
inferred← citeshttps://doi.org/10.2514/6.2002-5557openalex-snapshot
An SQP Adapted Simple Decomposition for Engineering Design
inferred← citeshttps://doi.org/10.34133/2020/1303672openalex-snapshot
Nonlinear Optimization of Orthotropic Steel Deck System Based on Response Surface Methodology
inferred← citeshttps://doi.org/10.3934/jimo.2018190openalex-snapshot
A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
inferred← citeshttps://doi.org/10.3934/naco.2012.2.19openalex-snapshot
Global convergence of an SQP algorithm for nonlinear optimization with overdetermined constraints
inferred← citeshttps://doi.org/10.3934/naco.2012.2.437openalex-snapshot
Path planning and collision avoidance for robots
inferred← citeshttps://doi.org/10.4208/jcm.1903-m2018-0072openalex-snapshot
A Multidimensional Filter SQP Algorithm for Nonlinear Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1803.09224openalex-snapshot
Inexact Sequential Quadratic Optimization with Penalty Parameter Updates Within the QP Solve: Extended Version
inferred← citeshttps://doi.org/10.68381/jca23016openalex-snapshot
How the Augmented Lagrangian Algorithm Can Deal with an Infeasible Convex Quadratic Optimization Problem
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.