An inexact spectral bundle method for convex quadratic semidefinite programming
From MaRDI portal
Publication:694539
DOI10.1007/s10589-011-9443-xzbMath1282.90120OpenAlexW2082113451MaRDI QIDQ694539
Publication date: 12 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9443-x
semidefinite programmingeigenvalue minimization problemapproximate subgradientsinexact spectral bundle methodnonsmooth optimization methods
Related Items (5)
A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization ⋮ Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization ⋮ A novel approach for solving semidefinite programs ⋮ A Subspace Method for Large-Scale Eigenvalue Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A quasi-Newton bundle method based on approximate subgradients
- Proximity control in bundle methods for convex nondifferentiable minimization
- A bundle-filter method for nonsmooth convex constrained optimization
- A bundle method for solving equilibrium problems
- Incremental-like bundle methods with application to energy planning
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Variable metric bundle methods: From conceptual to implementable forms
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- Dynamic bundle methods
- Error bounds for eigenvalue and semidefinite matrix inequality systems
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming
- Schedule-Based and Autoregressive Bus Running Time Modeling in the Presence of Driver-Bus Heterogeneity
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- Semi-Definite Matrix Constraints in Optimization
- Necessary conditions for ε-optimality
- Large-Scale Optimization of Eigenvalues
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- A Spectral Bundle Method for Semidefinite Programming
- First-Order and Second-Order Conditions for Error Bounds
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Survey of Bundle Methods for Nonsmooth Optimization
- The Euclidian Distance Matrix Completion Problem
- Nonsmooth sequential analysis in Asplund spaces
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- Algorithm 845
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A second-order bundle method to minimize the maximum eigenvalue function.
- A proximal bundle method based on approximate subgradients
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
This page was built for publication: An inexact spectral bundle method for convex quadratic semidefinite programming
