On the public citation graph
Semi-Definite Matrix Constraints in Optimization
0 signed · 125 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/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0093151openalex-snapshot
Second order corrections for non-differentiable optimization
inferredcites →https://doi.org/10.1007/bfb0120698openalex-snapshot
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
inferredcites →https://doi.org/10.1007/bfb0120976openalex-snapshot
Algorithms for the design of control systems subject to singular value inequalities
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50009-4openalex-snapshot
NUMERICAL EXPERIMENTS WITH AN EXACT L1 PENALTY FUNCTION METHOD
inferredcites →https://doi.org/10.1137/0902021openalex-snapshot
A Nonlinear Programming Problem in Statistics (Educational Testing)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199811/12)5:6<461::aid-nla141>3.0.co;2-vopenalex-snapshot
Computing the nearest diagonally dominant matrix
inferred← citeshttps://doi.org/10.1002/nla.282openalex-snapshot
SQP algorithms for solving Toeplitz matrix approximation problem
inferred← citeshttps://doi.org/10.1007/978-1-4020-6479-1_14openalex-snapshot
Sparsification for Monaural Source Separation
inferred← citeshttps://doi.org/10.1007/978-3-540-30110-3_61openalex-snapshot
Monaural Source Separation Using Spectral Cues
inferred← citeshttps://doi.org/10.1007/978-3-642-28572-1_42openalex-snapshot
Top-Down vs. Bottom-Up Model-Based Methodologies for Distributed Control: A Comparative Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-642-33712-3_13openalex-snapshot
Fast Regularization of Matrix-Valued Images
inferred← citeshttps://doi.org/10.1007/978-3-642-37331-2_3openalex-snapshot
Human Reidentification with Transferred Metric Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_10openalex-snapshot
Sensitivity Analysis for a Class of Convex Functions Defined Over a Space of Symmetric Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-54774-4_2openalex-snapshot
Fast Regularization of Matrix-Valued Images
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/bf01585173openalex-snapshot
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
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/bf02461553openalex-snapshot
The embedding problem for predistance matrices
inferred← citeshttps://doi.org/10.1007/bf02667002openalex-snapshot
Mixed method for solving the general convex programming problem
inferred← citeshttps://doi.org/10.1007/bfb0035472openalex-snapshot
Dikin's algorithm for matrix linear programming problems
inferred← citeshttps://doi.org/10.1007/pl00011370openalex-snapshot
Optimality conditions for nonconvex semidefinite programming
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/s00158-015-1285-1openalex-snapshot
Worst-case topology optimization of self-weight loaded structures using semi-definite programming
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/s00211-007-0095-9openalex-snapshot
Second-order nonsmooth optimization for H ∞ synthesis
inferred← citeshttps://doi.org/10.1007/s10100-008-0056-0openalex-snapshot
Semidefinite programming for the educational testing problem
inferred← citeshttps://doi.org/10.1007/s10107-002-0350-xopenalex-snapshot
Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0627-yopenalex-snapshot
Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems
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/s10107-012-0593-0openalex-snapshot
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
inferred← citeshttps://doi.org/10.1007/s10107-013-0735-zopenalex-snapshot
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
inferred← citeshttps://doi.org/10.1007/s10107980004aopenalex-snapshot
Nonsmooth analysis of eigenvalues
inferred← citeshttps://doi.org/10.1007/s10589-011-9443-xopenalex-snapshot
An inexact spectral bundle method for convex quadratic semidefinite programming
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/s11228-016-0365-8openalex-snapshot
A Fast Space-decomposition Scheme for Nonconvex Eigenvalue Optimization
inferred← citeshttps://doi.org/10.1007/s13369-020-05188-wopenalex-snapshot
Low-Rank Approximation of Circulant Matrix to a Noisy Matrix
inferred← citeshttps://doi.org/10.1007/s13369-024-09492-7openalex-snapshot
Approximating M-matrix in Learning Directed Acyclic Graphs Using Methods Involve Semidefinite Matrix Constraints
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90223-6openalex-snapshot
Computing a nearest symmetric positive semidefinite matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90173-8openalex-snapshot
When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?
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)00024-8openalex-snapshot
Positive definite constrained least-squares estimation of matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00271-ropenalex-snapshot
On a positive semidefinite relaxation of the cut polytope
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/j.amc.2015.05.119openalex-snapshot
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
inferred← citeshttps://doi.org/10.1016/j.laa.2004.06.002openalex-snapshot
Uniqueness of the solutions of some completion problems
inferred← citeshttps://doi.org/10.1016/j.laa.2025.03.017openalex-snapshot
Minimal compact operators, subdifferential of the maximum eigenvalue and semi-definite programming
inferred← citeshttps://doi.org/10.1016/s0096-3003(98)00031-9openalex-snapshot
Sensitivity analysis of the largest dependent eigenvalue functions of eigensystems
inferred← citeshttps://doi.org/10.1016/s0377-0427(98)00011-9openalex-snapshot
Hybrid methods for solving the educational testing problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
inferred← citeshttps://doi.org/10.1023/a:1008298700376openalex-snapshot
Computable Error Bounds for Semidefinite Programming
inferred← citeshttps://doi.org/10.1051/cocv:2000104openalex-snapshot
Computation of the distance to semi-algebraic sets
inferred← citeshttps://doi.org/10.1080/00207540903067193openalex-snapshot
A linear model for production management—optimal solving policies
inferred← citeshttps://doi.org/10.1080/01630563.2014.895763openalex-snapshot
Optimality Conditions in Semidefinite Programming
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/02331889108802317openalex-snapshot
On conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental design
inferred← citeshttps://doi.org/10.1080/02331930008844502openalex-snapshot
Does optimality imply ill-posedness? some remarks about certain min-max optimization problems
inferred← citeshttps://doi.org/10.1080/10556780701223970openalex-snapshot
Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
inferred← citeshttps://doi.org/10.1080/10556788.2013.858155openalex-snapshot
The spectral bundle method with second-order information
inferred← citeshttps://doi.org/10.1090/s0002-9939-1993-1116267-7openalex-snapshot
Matrix Completions, Norms, and Hadamard Products
inferred← citeshttps://doi.org/10.1093/imanum/22.3.329openalex-snapshot
Computing the nearest correlation matrix--a problem from finance
inferred← citeshttps://doi.org/10.1093/imanum/23.4.539openalex-snapshot
Inexact spectral projected gradient methods on convex sets
inferred← citeshttps://doi.org/10.1098/rsbm.2024.0037openalex-snapshot
Roger Fletcher. 29 January 1939—15 July 2016
inferred← citeshttps://doi.org/10.1109/37.621480openalex-snapshot
Algorithms and software for LMI problems in control
inferred← citeshttps://doi.org/10.1109/9.388700openalex-snapshot
A new Farkas lemma for positive semidefinite matrices
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.1995.480242openalex-snapshot
Linear programming with positive semi definite matrices
inferred← citeshttps://doi.org/10.1109/ijcnn.2010.5596731openalex-snapshot
A projection transform for non-Euclidean relational clustering
inferred← citeshttps://doi.org/10.1109/robot.2002.1014427openalex-snapshot
Estimating symmetric, positive definite matrices in robotic control
inferred← citeshttps://doi.org/10.1109/tac.2002.803545openalex-snapshot
Estimation of symmetric positive-definite matrices from imperfect measurements
inferred← citeshttps://doi.org/10.1109/tac.2020.2994894openalex-snapshot
Sampling Strategies for Data-Driven Inference of Input–Output System Properties
inferred← citeshttps://doi.org/10.1109/tpwrs.2013.2259642openalex-snapshot
Global Optimization of Non-Convex Hydro-Thermal Coordination Based on Semidefinite Programming
inferred← citeshttps://doi.org/10.1109/tsp.2016.2637314openalex-snapshot
Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
inferred← citeshttps://doi.org/10.1137/0326032openalex-snapshot
Positive Semidefinite Matrices: Characterization via Conical Hulls and Least-Squares Solution of a Matrix Equation
inferred← citeshttps://doi.org/10.1137/0331064openalex-snapshot
An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
inferred← citeshttps://doi.org/10.1137/0523015openalex-snapshot
On the Optimal Design of Columns Against Buckling
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/0609040openalex-snapshot
On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
inferred← citeshttps://doi.org/10.1137/0610026openalex-snapshot
On Maximizing the Minimum Eigenvalue of a Linear Combination of Symmetric Matrices
inferred← citeshttps://doi.org/10.1137/0611042openalex-snapshot
An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
inferred← citeshttps://doi.org/10.1137/0613062openalex-snapshot
Algorithms for Minimum Trace Factor Analysis
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/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/0806009openalex-snapshot
Convex Analysis on the Hermitian Matrices
inferred← citeshttps://doi.org/10.1137/1.9780898718829.ch4openalex-snapshot
4. Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/130933472openalex-snapshot
Numerical Optimization of Eigenvalues of Hermitian Matrix Functions
inferred← citeshttps://doi.org/10.1137/16m1105888openalex-snapshot
$LDL^T$ Direction Interior Point Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/21m1400705openalex-snapshot
Condition Number Minimization in Euclidean Jordan Algebras
inferred← citeshttps://doi.org/10.1137/s0036144596303984openalex-snapshot
Inverse Eigenvalue Problems
inferred← citeshttps://doi.org/10.1137/s089547989324598xopenalex-snapshot
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
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/s1052623495288866openalex-snapshot
Convex Analysis of Spectrally Defined Matrix Functions
inferred← citeshttps://doi.org/10.1137/s1052623496311776openalex-snapshot
The $\U$-Lagrangian of the Maximum Eigenvalue Function
inferred← citeshttps://doi.org/10.1137/s1052623499357945openalex-snapshot
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
inferred← citeshttps://doi.org/10.1177/014662169401800107openalex-snapshot
Gramian Matrices in Covariance Structure Models
inferred← citeshttps://doi.org/10.1184/r1/6475877openalex-snapshot
Minimax Localization of Structural Information in Large Noisy Matrices
inferred← citeshttps://doi.org/10.1287/moor.19.4.815openalex-snapshot
Measures for Symmetric Rank-One Updates
inferred← citeshttps://doi.org/10.1287/moor.21.3.576openalex-snapshot
Derivatives of Spectral Functions
inferred← citeshttps://doi.org/10.1515/dema-2017-0032openalex-snapshot
Concrete minimal 3 × 3 Hermitian matrices and some general cases
inferred← citeshttps://doi.org/10.1523/jneurosci.1563-06.2006openalex-snapshot
Sparse Representations for the Cocktail Party Problem
inferred← citeshttps://doi.org/10.18637/jss.v060.i03openalex-snapshot
Spectral Projected Gradient Methods: Review and Perspectives
inferred← citeshttps://doi.org/10.22199/s07160917.1988.0014.00001openalex-snapshot
On the additive inverse eigenvalue problem
inferred← citeshttps://doi.org/10.2298/fil1703737aopenalex-snapshot
Global convergence of the alternating projection method for the Max-Cut relaxation problem
inferred← citeshttps://doi.org/10.23919/acc.1986.4789123openalex-snapshot
Maximum Likelihood Identification of Structurally Constrained Covariances for Initial Condition Statistics
inferred← citeshttps://doi.org/10.3166/ejc.9.13-28openalex-snapshot
A Nonlinear SDP Approach to Fixed-Order Controller Synthesis and Comparison with Two Other Methods Applied to an Active Suspension System*
inferred← citeshttps://doi.org/10.4310/maa.2014.v21.n1.a5openalex-snapshot
Augmented-Lagrangian regularization of matrix-valued maps
inferred← citeshttps://doi.org/10.5555/127787.127826openalex-snapshot
A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs
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.