On the public citation graph

The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices

0 signed · 128 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/bf01071403openalex-snapshot
Methods of solution of nonlinear extremal problems
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1007/bf02165269openalex-snapshot
Computational aspects of F. L. Bauer's simultaneous iteration method
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferredcites →https://doi.org/10.1017/cbo9780511566172openalex-snapshot
Convexity
inferredcites →https://doi.org/10.1073/pnas.35.11.652openalex-snapshot
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I
inferredcites →https://doi.org/10.1090/qam/10667openalex-snapshot
The method of steepest descent for non-linear minimization problems
inferredcites →https://doi.org/10.1137/0304007openalex-snapshot
An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
inferredcites →https://doi.org/10.1147/rd.175.0420openalex-snapshot
Lower Bounds for the Partitioning of Graphs
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1522-2616(200103)223:1<135::aid-mana135>3.0.co;2-8openalex-snapshot
Etude de la Sensibilité de Toutes les Valeurs Propres non Nulles d'un Opérateur Compact Autoadjoint
inferred← citeshttps://doi.org/10.1002/nme.7449openalex-snapshot
Discrete variable topology optimization for maximizing single/multiple natural frequencies and frequency gaps considering the topological constraint
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_13openalex-snapshot
Cone-LP's and semidefinite programs: Geometry and a simplex-type method
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-7621-4_26openalex-snapshot
Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_7openalex-snapshot
Central Region Method
inferred← citeshttps://doi.org/10.1007/bf00939329openalex-snapshot
On minimax eigenvalue problems via constrained optimization
inferred← citeshttps://doi.org/10.1007/bf00939609openalex-snapshot
Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ?-subdifferential of the associated convex quadratic form
inferred← citeshttps://doi.org/10.1007/bf00940556openalex-snapshot
An optimization problem on subsets of the symmetric positive-semidefinite matrices
inferred← citeshttps://doi.org/10.1007/bf00941058openalex-snapshot
On the need for special purpose algorithms for minimax eigenvalue problems
inferred← citeshttps://doi.org/10.1007/bf01100204openalex-snapshot
Some geometric results in semidefinite programming
inferred← citeshttps://doi.org/10.1007/bf01299152openalex-snapshot
A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
inferred← citeshttps://doi.org/10.1007/bf01581147openalex-snapshot
A computational study of graph partitioning
inferred← citeshttps://doi.org/10.1007/bf01585173openalex-snapshot
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
inferred← citeshttps://doi.org/10.1007/bf01609012openalex-snapshot
A subgradient algorithm for certain minimax and minisum problems
inferred← citeshttps://doi.org/10.1007/bf01930896openalex-snapshot
The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
inferred← citeshttps://doi.org/10.1007/bf02032130openalex-snapshot
A projection technique for partitioning the nodes of a graph
inferred← citeshttps://doi.org/10.1007/bf02294158openalex-snapshot
Weighted Minimum Trace Factor Analysis
inferred← citeshttps://doi.org/10.1007/bf02366923openalex-snapshot
New algorithms for the weighted maximum cut problem on graphs
inferred← citeshttps://doi.org/10.1007/bf02614431openalex-snapshot
Semidefinite programming
inferred← citeshttps://doi.org/10.1007/bfb0116617openalex-snapshot
Computation of eigenvalues and eigenvectors
inferred← citeshttps://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bfb0120976openalex-snapshot
Algorithms for the design of control systems subject to singular value inequalities
inferred← citeshttps://doi.org/10.1007/pl00011388openalex-snapshot
A second-order bundle method to minimize the maximum eigenvalue function
inferred← citeshttps://doi.org/10.1007/s00186-017-0579-zopenalex-snapshot
A space decomposition scheme for maximum eigenvalue functions and its applications
inferred← citeshttps://doi.org/10.1007/s002110050109openalex-snapshot
Sensitivity analysis of all eigenvalues of a symmetric matrix
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/s10107-005-0634-zopenalex-snapshot
Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
inferred← citeshttps://doi.org/10.1007/s10107-005-0635-yopenalex-snapshot
Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
inferred← citeshttps://doi.org/10.1007/s10107-006-0032-1openalex-snapshot
Solving large-scale semidefinite programs in parallel
inferred← citeshttps://doi.org/10.1007/s10589-016-9834-0openalex-snapshot
Nonconvex bundle method with application to a delamination problem
inferred← citeshttps://doi.org/10.1007/s10898-015-0273-8openalex-snapshot
Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems
inferred← citeshttps://doi.org/10.1007/s10915-024-02636-9openalex-snapshot
Spectrally Constrained Optimization
inferred← citeshttps://doi.org/10.1007/s11228-016-0365-8openalex-snapshot
A Fast Space-decomposition Scheme for Nonconvex Eigenvalue Optimization
inferred← citeshttps://doi.org/10.1007/s11228-017-0453-4openalex-snapshot
Non-Smooth Optimization for Robust Control of Infinite-Dimensional Systems
inferred← citeshttps://doi.org/10.1016/0005-1098(82)90087-5openalex-snapshot
Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
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/0166-218x(94)00155-7openalex-snapshot
Solving the max-cut problem using eigenvalues
inferred← citeshttps://doi.org/10.1016/0198-0254(87)96151-6openalex-snapshot
The formulation and analysis of numerical methods for inverse eigenvalue problems
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90016-5openalex-snapshot
On duality for Boolean programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50007-6openalex-snapshot
Partitioning, Spectra and Linear Programming
inferred← citeshttps://doi.org/10.1016/j.amc.2015.05.119openalex-snapshot
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
inferred← citeshttps://doi.org/10.1016/j.apnum.2012.12.006openalex-snapshot
Perron vector optimization applied to search engines
inferred← citeshttps://doi.org/10.1016/j.cam.2011.01.015openalex-snapshot
A new Lagrangian net algorithm for solving max-bisection problems
inferred← citeshttps://doi.org/10.1016/j.jsv.2012.04.026openalex-snapshot
Eigenvalue optimization against brake squeal: Symmetry, mathematical background and experiments
inferred← citeshttps://doi.org/10.1016/j.sysconle.2006.06.008openalex-snapshot
IQC analysis and synthesis via nonsmooth optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00083-3openalex-snapshot
Spectral partitioning with multiple eigenvectors
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00097-xopenalex-snapshot
Semidefinite programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00021-5openalex-snapshot
Spectral methods for graph bisection problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00143-6openalex-snapshot
Semidefinite programming
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00060-0openalex-snapshot
Algorithms for graph partitioning problems by means of eigenspace relaxations
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30493-7openalex-snapshot
Controller Design via Nonsmooth Multi-Directional Search
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54929-0openalex-snapshot
Aspects of Optimization-based CADCS
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)63537-7openalex-snapshot
A Nondifferentiable Optimization Algorithm for the Design of Control Systems Subject to Singular Value Inequalities Over a Frequency Range
inferred← citeshttps://doi.org/10.1017/s0962492900002646openalex-snapshot
Eigenvalue optimization
inferred← citeshttps://doi.org/10.1023/a:1014004625997openalex-snapshot
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
inferred← citeshttps://doi.org/10.1023/a:1022626120665openalex-snapshot
Robust Stability and Performance Analysis of Uncertain Systems Using Linear Matrix Inequalities
inferred← citeshttps://doi.org/10.1080/01630563.2016.1138969openalex-snapshot
A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
inferred← citeshttps://doi.org/10.1080/01630569508816616openalex-snapshot
Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices
inferred← citeshttps://doi.org/10.1080/02331939208843781openalex-snapshot
Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
inferred← citeshttps://doi.org/10.1080/03601218308907458openalex-snapshot
A Nondifferentiable Optimization Algorithm for Structural Problems with Eigenvalue Inequality Constraints*
inferred← citeshttps://doi.org/10.1080/09720502.2007.10700521openalex-snapshot
Identifying redundant linear constraints in systems of linear matrix inequality constraints
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.1109/37.621480openalex-snapshot
Algorithms and software for LMI problems in control
inferred← citeshttps://doi.org/10.1109/43.144852openalex-snapshot
An efficient eigenvector approach for finding netlist partitions
inferred← citeshttps://doi.org/10.1109/acc.1994.751863openalex-snapshot
Biaffine matrix inequality properties and computational methods
inferred← citeshttps://doi.org/10.1109/acc.2000.879159openalex-snapshot
Applications of semidefinite programming in process control
inferred← citeshttps://doi.org/10.1109/cdc.1983.269659openalex-snapshot
A study of minimizing sequences
inferred← citeshttps://doi.org/10.1109/cdc.1983.269661openalex-snapshot
Algorithm models for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1109/cdc.1992.371097openalex-snapshot
A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400165openalex-snapshot
Mixed H2/H∞ control via nonsmooth optimization
inferred← citeshttps://doi.org/10.1109/iciea.2006.257082openalex-snapshot
Frequency Domain H∞ Synthesis using Nonsmooth Techniques
inferred← citeshttps://doi.org/10.1109/jproc.1998.735454openalex-snapshot
Linear Matrix Inequalities In System And Control Theory
inferred← citeshttps://doi.org/10.1109/tac.1981.1102702openalex-snapshot
On the solution of singular value inequalities over a continuum of frequencies
inferred← citeshttps://doi.org/10.1109/tac.2005.860290openalex-snapshot
Nonsmooth H ∞ Synthesis
inferred← citeshttps://doi.org/10.1109/tpami.2021.3127870openalex-snapshot
Generalizing Correspondence Analysis for Applications in Machine Learning
inferred← citeshttps://doi.org/10.1111/j.1467-9574.1996.tb01485.xopenalex-snapshot
Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
inferred← citeshttps://doi.org/10.1137/0320034openalex-snapshot
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
inferred← citeshttps://doi.org/10.1137/0321010openalex-snapshot
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
inferred← citeshttps://doi.org/10.1137/0322036openalex-snapshot
A Study of Minimizing Sequences
inferred← citeshttps://doi.org/10.1137/0323031openalex-snapshot
Algorithm Models for Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1137/0323032openalex-snapshot
Semi-Definite Matrix Constraints in Optimization
inferred← citeshttps://doi.org/10.1137/060665191openalex-snapshot
A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
inferred← citeshttps://doi.org/10.1137/0609021openalex-snapshot
On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
inferred← citeshttps://doi.org/10.1137/0609032openalex-snapshot
Dual Algorithm for Orthogonal Procrustes Rotations
inferred← citeshttps://doi.org/10.1137/0613006openalex-snapshot
On the Sum of the Largest Eigenvalues of a Symmetric Matrix
inferred← citeshttps://doi.org/10.1137/070685026openalex-snapshot
Mixed $H_2/H_\infty$ Control via Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/0724043openalex-snapshot
The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
inferred← citeshttps://doi.org/10.1137/0802007openalex-snapshot
Large-Scale Optimization of Eigenvalues
inferred← citeshttps://doi.org/10.1137/0802008openalex-snapshot
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
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/0805028openalex-snapshot
On Eigenvalue Optimization
inferred← citeshttps://doi.org/10.1137/0806020openalex-snapshot
An Interior-Point Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/090762671openalex-snapshot
Approximating Semidefinite Packing Programs
inferred← citeshttps://doi.org/10.1137/1038003openalex-snapshot
Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/110827144openalex-snapshot
On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
inferred← citeshttps://doi.org/10.1137/130933472openalex-snapshot
Numerical Optimization of Eigenvalues of Hermitian Matrix Functions
inferred← citeshttps://doi.org/10.1137/21m1402340openalex-snapshot
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
inferred← citeshttps://doi.org/10.1137/s0036144503423264openalex-snapshot
Fastest Mixing Markov Chain on a Graph
inferred← citeshttps://doi.org/10.1137/s0363012904441684openalex-snapshot
Controller Design via Nonsmooth Multidirectional Search
inferred← citeshttps://doi.org/10.1137/s089547989324598xopenalex-snapshot
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
inferred← citeshttps://doi.org/10.1137/s0895479895283173openalex-snapshot
Group Invariance and Convex Matrix Analysis
inferred← citeshttps://doi.org/10.1137/s1052623496311776openalex-snapshot
The $\U$-Lagrangian of the Maximum Eigenvalue Function
inferred← citeshttps://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.21.3.576openalex-snapshot
Derivatives of Spectral Functions
inferred← citeshttps://doi.org/10.1287/moor.23.2.339openalex-snapshot
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
inferred← citeshttps://doi.org/10.1287/moor.27.3.567.317openalex-snapshot
Approximating Subdifferentials by Random Sampling of Gradients
inferred← citeshttps://doi.org/10.1287/opre.46.5.655openalex-snapshot
Constrained Maximum-Entropy Sampling
inferred← citeshttps://doi.org/10.1515/ijnsns.2001.2.2.139openalex-snapshot
Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
inferred← citeshttps://doi.org/10.23919/acc.1993.4793262openalex-snapshot
Control System Analysis and Synthesis via Linear Matrix Inequalities
inferred← citeshttps://doi.org/10.3934/jimo.2016039openalex-snapshot
The bundle scheme for solving arbitrary eigenvalue optimizations
inferred← citeshttps://doi.org/10.4208/jcm.v23.n6.p619openalex-snapshot
A Feasible Direction Algorithm Without Line Search for Solving Max-Bisection Problems
inferred← citeshttps://doi.org/10.68381/jca03011openalex-snapshot
On Extreme Singular Values of Matrix Valued Functions
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.