On the public citation graph

An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices

0 signed · 120 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-1-4612-4438-7_1openalex-snapshot
Matrix Perturbation Theory
inferredcites →https://doi.org/10.1007/978-1-4757-2108-9_14openalex-snapshot
Application of Analytic Centers to Feedback Design for Systems with Uncertainties
inferredcites →https://doi.org/10.1007/978-1-4757-6019-4_27openalex-snapshot
The BT-Algorithm for Minimizing a Nonsmooth Functional Subject to Linear Constraints
inferredcites →https://doi.org/10.1007/978-1-4757-9859-3_6openalex-snapshot
Nonsmooth Optimization
inferredcites →https://doi.org/10.1007/bf00939329openalex-snapshot
On minimax eigenvalue problems via constrained optimization
inferredcites →https://doi.org/10.1007/bf01371086openalex-snapshot
Interior-point methods for convex programming
inferredcites →https://doi.org/10.1007/bf01445161openalex-snapshot
Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
inferredcites →https://doi.org/10.1007/bf01588796openalex-snapshot
On the convergence of the method of analytic centers when applied to convex quadratic programs
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bfb0042223openalex-snapshot
An implementation of the method of analytic centers
inferredcites →https://doi.org/10.1007/bfb0043914openalex-snapshot
An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
inferredcites →https://doi.org/10.1007/bfb0083587openalex-snapshot
On the method of analytic centers for solving smooth convex programs
inferredcites →https://doi.org/10.1057/jors.1967.61openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1080/00207178908559769openalex-snapshot
Structured and simultaneous Lyapunov functions for system stability problems
inferredcites →https://doi.org/10.1137/0323032openalex-snapshot
Semi-Definite Matrix Constraints in Optimization
inferredcites →https://doi.org/10.1137/0609021openalex-snapshot
On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
inferredcites →https://doi.org/10.1137/0609040openalex-snapshot
On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
inferredcites →https://doi.org/10.1137/0801002openalex-snapshot
A New Variational Result for Quasi-Newton Formulae
inferredcites →https://doi.org/10.1137/0802007openalex-snapshot
Large-Scale Optimization of Eigenvalues
inferredcites →https://doi.org/10.1137/0901025openalex-snapshot
A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032701.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/nme.1620380209openalex-snapshot
An algorithm for optimization of non‐linear shell structures
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_477openalex-snapshot
Solving Large Scale And Sparse Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_41openalex-snapshot
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_627openalex-snapshot
Solving Large Scale and Sparse Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-1-4612-1962-0_8openalex-snapshot
Eigenvalues in Optimum Structural Design
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_7openalex-snapshot
Central Region Method
inferred← citeshttps://doi.org/10.1007/978-3-319-18842-3_6openalex-snapshot
Conic Linear Programming
inferred← citeshttps://doi.org/10.1007/bf01099648openalex-snapshot
Global optimization for the Biaffine Matrix Inequality problem
inferred← citeshttps://doi.org/10.1007/bf01580085openalex-snapshot
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
inferred← citeshttps://doi.org/10.1007/bf01581723openalex-snapshot
Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs
inferred← citeshttps://doi.org/10.1007/bf01582229openalex-snapshot
An interior-point method for fractional programs with convex constraints
inferred← citeshttps://doi.org/10.1007/bf01585558openalex-snapshot
A primal—dual potential reduction method for problems involving matrix inequalities
inferred← citeshttps://doi.org/10.1007/bf02143127openalex-snapshot
A globally convergent method for solving nonlinear equations without the differentiability condition
inferred← citeshttps://doi.org/10.1007/bf02614433openalex-snapshot
An exact duality theory for semidefinite programming and its complexity implications
inferred← citeshttps://doi.org/10.1007/bf02614434openalex-snapshot
The projective method for solving linear matrix inequalities
inferred← citeshttps://doi.org/10.1007/bf02680556openalex-snapshot
Merit functions for semi-definite complemetarity problems
inferred← citeshttps://doi.org/10.1007/bf02680567openalex-snapshot
Affine scaling algorithm fails for semidefinite programming
inferred← citeshttps://doi.org/10.1007/s00211-007-0095-9openalex-snapshot
Second-order nonsmooth optimization for H ∞ synthesis
inferred← citeshttps://doi.org/10.1007/s10107-003-0451-1openalex-snapshot
First- and second-order methods for semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107980021aopenalex-snapshot
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
inferred← citeshttps://doi.org/10.1007/s11075-009-9270-7openalex-snapshot
A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization
inferred← citeshttps://doi.org/10.1016/0005-1098(93)90175-sopenalex-snapshot
The complex structured singular value
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00068-bopenalex-snapshot
On minimizing the largest eigenvalue of a symmetric matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90465-zopenalex-snapshot
Method of centers for minimizing generalized eigenvalues
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90470-9openalex-snapshot
A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00130-8openalex-snapshot
Explicit solutions for interval semidefinite linear programs
inferred← citeshttps://doi.org/10.1016/0167-6911(94)90006-xopenalex-snapshot
Robust performance of linear parametrically varying systems using parametrically-dependent linear feedback
inferred← citeshttps://doi.org/10.1016/j.amc.2010.02.010openalex-snapshot
Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111903openalex-snapshot
Performance optimization for continuous network localization
inferred← citeshttps://doi.org/10.1016/j.automatica.2026.112921openalex-snapshot
Performance optimization for discrete network localization
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00099-3openalex-snapshot
Symmetric primal-dual path-following algorithms for semidefinite programming
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43034-5openalex-snapshot
Maxmin Input Design for Linear Dynamic Systems
inferred← citeshttps://doi.org/10.1017/s1446181100013511openalex-snapshot
A solution method for combined semi-infinite and semi-definite programming
inferred← citeshttps://doi.org/10.1023/a:1011562523132openalex-snapshot
An Interior Method for Nonconvex Semidefinite Programs
inferred← citeshttps://doi.org/10.1051/cocv:2000104openalex-snapshot
Computation of the distance to semi-algebraic sets
inferred← citeshttps://doi.org/10.1080/02522667.1998.10699374openalex-snapshot
Input design for linear dynamic systems using maxmin criteria
inferred← citeshttps://doi.org/10.1080/10556780008805787openalex-snapshot
Penalty/Barrier multiplier algorthm for semidefinit programming∗
inferred← citeshttps://doi.org/10.1080/1055678031000111227openalex-snapshot
A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming
inferred← citeshttps://doi.org/10.1080/10556780802571392openalex-snapshot
On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
inferred← citeshttps://doi.org/10.1080/10556788.2013.858155openalex-snapshot
The spectral bundle method with second-order information
inferred← citeshttps://doi.org/10.1080/10556789508805599openalex-snapshot
Max-min eigenvalue problems, primal-dual Interior point algorithms, and Trust region subproblemst
inferred← citeshttps://doi.org/10.1080/10556789608805639openalex-snapshot
A truncated log Barrier algorithm for large scale convex programming and minmax problems:implementation and computational results ∗
inferred← citeshttps://doi.org/10.1080/10556789808805695openalex-snapshot
Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp ∗
inferred← citeshttps://doi.org/10.1080/10556789908805749openalex-snapshot
Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
inferred← citeshttps://doi.org/10.1090/fic/018/14openalex-snapshot
Cutting plane algorithms for semidefinite relaxations
inferred← citeshttps://doi.org/10.1109/37.621480openalex-snapshot
Algorithms and software for LMI problems in control
inferred← citeshttps://doi.org/10.1109/87.817699openalex-snapshot
A discrete Fourier transform approach to a constrained mixed H/sup 2/ sensitivity optimization with applications
inferred← citeshttps://doi.org/10.1109/9.284871openalex-snapshot
A time-domain approach to model validation
inferred← citeshttps://doi.org/10.1109/9.388682openalex-snapshot
Multiobjective H/sub 2//H/sub ∞/ control
inferred← citeshttps://doi.org/10.1109/9.701088openalex-snapshot
A generalization of the structured singular value and its application to model validation
inferred← citeshttps://doi.org/10.1109/acc.1994.751861openalex-snapshot
The projective method for solving linear matrix inequalities
inferred← citeshttps://doi.org/10.1109/acc.1994.751863openalex-snapshot
Biaffine matrix inequality properties and computational methods
inferred← citeshttps://doi.org/10.1109/acc.2007.4283040openalex-snapshot
Brittle Synergy: An optimal decomposition of minimax team decision problems
inferred← citeshttps://doi.org/10.1109/aerocs.1993.720952openalex-snapshot
Control of Parameter-Dependent Systems: Applications to H/sub ∞ Gain-Scheduling
inferred← citeshttps://doi.org/10.1109/cacsd.1996.555287openalex-snapshot
Algorithms and software tools for LMI problems in control: an overview
inferred← citeshttps://doi.org/10.1109/cdc.1992.371241openalex-snapshot
Mixed mu upper bound computation
inferred← citeshttps://doi.org/10.1109/cdc.1992.371775openalex-snapshot
On minimizing the largest eigenvalue of a symmetric matrix
inferred← citeshttps://doi.org/10.1109/cdc.1993.325133openalex-snapshot
Algebraic solvability tests for linear matrix inequalities
inferred← citeshttps://doi.org/10.1109/cdc.1993.325188openalex-snapshot
The Caratheodory-Fejer problem and H/sub ∞/ identification: a time domain approach
inferred← citeshttps://doi.org/10.1109/cdc.1993.325342openalex-snapshot
Control of linear fractional transformations
inferred← citeshttps://doi.org/10.1109/cdc.1993.325889openalex-snapshot
Model reduction of behavioural systems
inferred← citeshttps://doi.org/10.1109/cdc.1994.411445openalex-snapshot
A global optimization approach for the BMI problem
inferred← citeshttps://doi.org/10.1109/cdc.1996.577575openalex-snapshot
A simple numerical method for minimizing the maximum eigenvalues of symmetric matrices via nonlinear differential equation solvers
inferred← citeshttps://doi.org/10.1109/cdc.1998.760607openalex-snapshot
Parametrized LMIs in control theory
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434802openalex-snapshot
Synergy brittleness in decentralized minimax decision problems
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383707openalex-snapshot
Performance Optimization of Angle-Based Network Localization
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383869openalex-snapshot
Motion Planning for The Estimation of Functions*
inferred← citeshttps://doi.org/10.1109/tci.2019.2948733openalex-snapshot
Generalized Phase Gradient Autofocus Using Semidefinite Relaxation Phase Estimation
inferred← citeshttps://doi.org/10.1109/tit.2008.917634openalex-snapshot
The Diversity Order of the Semidefinite Relaxation Detector
inferred← citeshttps://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/0805008openalex-snapshot
A Practical Interior-Point Method for Convex Programming
inferred← citeshttps://doi.org/10.1137/0806009openalex-snapshot
Convex Analysis on the Hermitian Matrices
inferred← citeshttps://doi.org/10.1137/0806016openalex-snapshot
A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems
inferred← citeshttps://doi.org/10.1137/0806020openalex-snapshot
An Interior-Point Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/1038003openalex-snapshot
Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/22m1529762openalex-snapshot
Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization
inferred← citeshttps://doi.org/10.1137/s036301299732612xopenalex-snapshot
Parameterized LMIs in Control Theory
inferred← citeshttps://doi.org/10.1137/s0895479893244833openalex-snapshot
A Hybrid Algorithm for Optimizing Eigenvalues of Symmetric Definite Pencils
inferred← citeshttps://doi.org/10.1137/s0895479893251939openalex-snapshot
On a Matrix Generalization of Affine-Scaling Vector Fields
inferred← citeshttps://doi.org/10.1137/s0895479895283173openalex-snapshot
Group Invariance and Convex Matrix Analysis
inferred← citeshttps://doi.org/10.1137/s089547989631442xopenalex-snapshot
Fixing Variables in Semidefinite Relaxations
inferred← citeshttps://doi.org/10.1137/s1052623494269035openalex-snapshot
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
inferred← citeshttps://doi.org/10.1137/s1052623494270741openalex-snapshot
Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
inferred← citeshttps://doi.org/10.1137/s1052623495293056openalex-snapshot
Primal--Dual Path-Following Algorithms for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623495296115openalex-snapshot
On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623496308618openalex-snapshot
Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
inferred← citeshttps://doi.org/10.1137/s1052623496311776openalex-snapshot
The $\U$-Lagrangian of the Maximum Eigenvalue Function
inferred← citeshttps://doi.org/10.1137/s1052623496312836openalex-snapshot
Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s1052623497318980openalex-snapshot
A Potential Reduction Newton Method for Constrained Equations
inferred← citeshttps://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1145/237814.237980openalex-snapshot
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
inferred← citeshttps://doi.org/10.1287/moor.21.3.576openalex-snapshot
Derivatives of Spectral Functions
inferred← citeshttps://doi.org/10.1287/moor.24.1.149openalex-snapshot
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
inferred← citeshttps://doi.org/10.1299/kikaic.63.1125openalex-snapshot
A Simple Numerical Method for Minimizing the Maximum Eigenvalues of Symmetric Matrices via Nonlinear Differential Equation Solvers
inferred← citeshttps://doi.org/10.1590/0101-7438.2014.034.03.0495openalex-snapshot
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
inferred← citeshttps://doi.org/10.2140/memocs.2023.11.393openalex-snapshot
Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method
inferred← citeshttps://doi.org/10.3934/jimo.2016039openalex-snapshot
The bundle scheme for solving arbitrary eigenvalue optimizations
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3430openalex-snapshot
Domain Adaptation: Learning Bounds and Algorithms
inferred← citeshttps://doi.org/10.70675/868e4d2fze9eez4b8fz9a44z73d4803da3a6openalex-snapshot
Geometry of isotropy classes for representation of groups with applications in Mechanics of Materials
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.