On the public citation graph

A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs

0 signed · 92 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/1-84628-095-8_8openalex-snapshot
The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
inferredcites →https://doi.org/10.1007/978-1-4471-4610-0openalex-snapshot
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications
inferredcites →https://doi.org/10.1007/978-3-642-78240-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/b138725openalex-snapshot
Probabilistic and Randomized Methods for Design under Uncertainty
inferredcites →https://doi.org/10.1007/bf01071394openalex-snapshot
Cut-off method with space extension in convex programming problems
inferredcites →https://doi.org/10.1007/bf01585551openalex-snapshot
A cutting plane algorithm for convex programming that uses analytic centers
inferredcites →https://doi.org/10.1007/bf02341816openalex-snapshot
Utilization of the operation of space dilatation in the minimization of convex functions
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/s10107-003-0499-yopenalex-snapshot
Uncertain convex programs: randomized solutions and confidence levels
inferredcites →https://doi.org/10.1007/s10107980011aopenalex-snapshot
Shallow, deep and very deep cuts in the analytic center cutting plane method
inferredcites →https://doi.org/10.1016/0024-3795(93)90465-zopenalex-snapshot
Method of centers for minimizing generalized eigenvalues
inferredcites →https://doi.org/10.1016/0378-4754(84)90101-0openalex-snapshot
Problem complexity and method efficiency in optimization
inferredcites →https://doi.org/10.1016/j.automatica.2003.07.001openalex-snapshot
Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities
inferredcites →https://doi.org/10.1016/j.automatica.2006.09.020openalex-snapshot
Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
inferredcites →https://doi.org/10.1016/j.sysconle.2007.11.003openalex-snapshot
A new vertex result for robustness problems with interval matrix uncertainty
inferredcites →https://doi.org/10.1016/s0167-6911(01)00117-7openalex-snapshot
Probabilistic robust design with linear quadratic regulators
inferredcites →https://doi.org/10.1016/s0167-6911(03)00115-4openalex-snapshot
An ellipsoid algorithm for probabilistic robust controller design
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1080/1055678021000060829aopenalex-snapshot
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method
inferredcites →https://doi.org/10.1080/10556780310001607956openalex-snapshot
Polynomial Interior Point Cutting Plane Methods
inferredcites →https://doi.org/10.1109/9.964685openalex-snapshot
Stochastic algorithms for exact and approximate feasibility of robust LMIs
inferredcites →https://doi.org/10.1109/cdc.2000.911987openalex-snapshot
Probabilistic robust design with linear quadratic regulators
inferredcites →https://doi.org/10.1109/cdc.2003.1272896openalex-snapshot
Probabilistic design of a robust state-feedback controller based on parameter-dependent Lyapunov functions
inferredcites →https://doi.org/10.1109/tac.2006.875041openalex-snapshot
The Scenario Approach to Robust Control Design
inferredcites →https://doi.org/10.1137/s0363012901398691openalex-snapshot
A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters
inferredcites →https://doi.org/10.1137/s0895479803430953openalex-snapshot
Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
inferredcites →https://doi.org/10.1137/s1052623400374756openalex-snapshot
On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
inferredcites →https://doi.org/10.1137/s1052623493258635openalex-snapshot
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
inferredcites →https://doi.org/10.1137/s1052623496305717openalex-snapshot
Robust Solutions to Uncertain Semidefinite Programs
inferredcites →https://doi.org/10.1198/tech.2007.s485openalex-snapshot
Probabilistic and Randomized Methods for Design Under Uncertainty
inferredcites →https://doi.org/10.1287/moor.23.4.769openalex-snapshot
Robust Convex Optimization
inferredcites →https://doi.org/10.13097/archive-ouverte/unige:159openalex-snapshot
The homogeneous analytic center cutting plane method
inferredcites →https://doi.org/10.2307/2581380openalex-snapshot
Problem Complexity and Method Efficiency in Optimization
inferredcites →https://doi.org/10.23919/ecc.2007.7068479openalex-snapshot
A new vertex result for robustness problems with interval matrix uncertainty

What points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w8403openalex-snapshot
Algorithms for Optimal AC Power Flow in the Presence of Renewable Sources
inferred← citeshttps://doi.org/10.1002/asjc.1006openalex-snapshot
A New Probabilistic Robust Control Approach for System with Uncertain Parameters
inferred← citeshttps://doi.org/10.1007/978-1-4471-4610-0_11openalex-snapshot
Sequential Methods for Probabilistic Design
inferred← citeshttps://doi.org/10.1007/s00158-007-0145-zopenalex-snapshot
Optimization under uncertainty with applications to design of truss structures
inferred← citeshttps://doi.org/10.1007/s00542-013-1827-7openalex-snapshot
Probabilistic analytic center cutting plane method in robust $${\mathcal{H}}_2$$ H 2 track following control
inferred← citeshttps://doi.org/10.1007/s11750-011-0172-1openalex-snapshot
An algorithm for semi-infinite polynomial optimization
inferred← citeshttps://doi.org/10.1016/j.automatica.2010.05.008openalex-snapshot
Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
inferred← citeshttps://doi.org/10.1016/j.automatica.2011.02.029openalex-snapshot
Research on probabilistic methods for control system design
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.02.042openalex-snapshot
Robust control of uncertain systems: Classical results and recent developments
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.04.005openalex-snapshot
A statistical learning theory approach for uncertain linear and bilinear matrix inequalities
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.11.004openalex-snapshot
Randomized methods for design of uncertain systems: Sample complexity and sequential algorithms
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.11.010openalex-snapshot
A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.09.448openalex-snapshot
R-RoMulOC: A unified tool for randomized and robust multiobjective control
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.763openalex-snapshot
Randomized Constraints Consensus for Distributed Robust Linear Programming
inferred← citeshttps://doi.org/10.1016/j.ifacol.2026.01.068openalex-snapshot
An evaluation of Sample Average Approximation applied to the design of impulsive thrust space collision avoidance maneuvers
inferred← citeshttps://doi.org/10.1016/j.riai.2012.11.005openalex-snapshot
Un algoritmo secuencial, aleatorio y óptimo para problemas de factibilidad robusta
inferred← citeshttps://doi.org/10.1016/j.sysconle.2009.12.009openalex-snapshot
Iterative robust control: Speeding up improvement through iterations
inferred← citeshttps://doi.org/10.1080/10556780802712889openalex-snapshot
Cutting-set methods for robust convex optimization with pessimizing oracles
inferred← citeshttps://doi.org/10.1109/acc.2012.6314838openalex-snapshot
Randomized control design through probabilistic validation
inferred← citeshttps://doi.org/10.1109/acc.2012.6315611openalex-snapshot
An Ellipsoid Algorithm for linear optimization with uncertain LMI constraints
inferred← citeshttps://doi.org/10.1109/cacsd.2010.5612794openalex-snapshot
Sequential randomized algorithms: A probabilistic cutting plane technique based on maximum volume ellipsoid center
inferred← citeshttps://doi.org/10.1109/cacsd.2013.6663480openalex-snapshot
Sequential randomized algorithms for sampled convex optimization
inferred← citeshttps://doi.org/10.1109/cdc.2006.377664openalex-snapshot
An Iterative Localization Method for Probabilistic Feasibility of Uncertain LMIs
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434992openalex-snapshot
Sequential randomized algorithms for robust optimization
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739188openalex-snapshot
A randomized cutting plane scheme with geometric convergence: Probabilistic analysis and SDP applications
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400359openalex-snapshot
Probabilistic cutting plane technique based on maximum volume ellipsoid center
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799227openalex-snapshot
Repetitive Scenario Design
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263835openalex-snapshot
A randomized distributed ellipsoid algorithm for uncertain feasibility problems
inferred← citeshttps://doi.org/10.1109/ecc.2014.6862603openalex-snapshot
Probabilistic analytic center cutting plane method with multiple cuts
inferred← citeshttps://doi.org/10.1109/iecon.2011.6119857openalex-snapshot
ℌ∞ probabilistic robust control of Hard Disk Drive
inferred← citeshttps://doi.org/10.1109/jas.2015.7032909openalex-snapshot
Probabilistic robust linear parameter-varying control of a small helicopter using iterative scenario approach
inferred← citeshttps://doi.org/10.1109/pes.2009.5275310openalex-snapshot
A subgradient-based cutting plane method to calculate convex hull market prices
inferred← citeshttps://doi.org/10.1109/pes.2010.5589713openalex-snapshot
The subgradient-simplex based cutting plane method for convex hull pricing
inferred← citeshttps://doi.org/10.1109/sice.2007.4421242openalex-snapshot
Randomized algorithms for robust feasibility problems with general nonconvex constraints
inferred← citeshttps://doi.org/10.1109/tac.2008.2008335openalex-snapshot
Notes on the Scenario Design Approach
inferred← citeshttps://doi.org/10.1109/tac.2009.2031207openalex-snapshot
Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
inferred← citeshttps://doi.org/10.1109/tac.2015.2423871openalex-snapshot
Sequential Randomized Algorithms for Robust Convex Optimization
inferred← citeshttps://doi.org/10.1109/tac.2015.2494875openalex-snapshot
Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
inferred← citeshttps://doi.org/10.1109/tcns.2020.3024483openalex-snapshot
Randomized Constraints Consensus for Distributed Robust Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1109/tpwrs.2013.2243173openalex-snapshot
The Subgradient Simplex Cutting Plane Method for Extended Locational Marginal Prices
inferred← citeshttps://doi.org/10.1109/wcica.2010.5554288openalex-snapshot
The subgradient-simplex based cutting plane method to solve Linear matrix inequalities
inferred← citeshttps://doi.org/10.1137/080742506openalex-snapshot
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
inferred← citeshttps://doi.org/10.11509/isciesci.55.5_181openalex-snapshot
ランダマイズドアルゴリズムによるロバスト制御系解析・設計( 制御系解析・設計における数値計算/数式処理ソフトウェアの活用)
inferred← citeshttps://doi.org/10.1201/b10384-76openalex-snapshot
Self-Tuning Control
inferred← citeshttps://doi.org/10.2172/2229681openalex-snapshot
Quantum Optimization: Potential, Challenges, and the Path Forward
inferred← citeshttps://doi.org/10.23919/ecc.2007.7068667openalex-snapshot
A sequentially optimal randomized algorithm for robust LMI feasibility problems
inferred← citeshttps://doi.org/10.3182/20080706-5-kr-1001.00066openalex-snapshot
RACT: Randomized Algorithms Control Toolbox for MATLAB
inferred← citeshttps://doi.org/10.3182/20080706-5-kr-1001.00067openalex-snapshot
Stochastic Ellipsoid Methods with Multiple Cuts
inferred← citeshttps://doi.org/10.48550/arxiv.1101.4122openalex-snapshot
An algorithm for semi-infinite polynomial optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1811.05397openalex-snapshot
Algorithms for Optimal AC Power Flow in the Presence of Renewable Sources
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03400openalex-snapshot
A Cutting-plane Method for Semidefinite Programming with Potential Applications on Noisy Quantum Devices
inferred← citeshttps://doi.org/10.5281/zenodo.40396openalex-snapshot
Learning And Clean-Up In A Large Scale Music Database
inferred← citeshttps://doi.org/10.5687/sss.2009.137openalex-snapshot
Robust Optimization via Probabilistic Cutting Plane Technique
inferred← citeshttps://doi.org/10.5687/sss.2010.260openalex-snapshot
A Primal-Dual Setting for Probabilistic Feasibility of Robust LMIs
inferred← citeshttps://doi.org/10.9746/sicetr.45.711openalex-snapshot
Probabilistic Cutting Plane Technique Based on Maximum Volume Ellipsoid Center
inferred← citeshttps://doi.org/10.9746/ve.sicetr1965.43.1165openalex-snapshot
Randomized Algorithms for Robust Feasibility Problems with General Nonconvex Constraints
inferred← citeshttps://doi.org/10.9746/ve.sicetr1965.44.1027openalex-snapshot
Sequential Randomized Algorithms for Robust 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.