Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
type: Item
instance of: scholarly article
title: Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
zbMATH Open document ID: 1410.90148
author: Jian Lv
author: Jin-He Wang
author: Li-Ping Pang
published in: Applied Mathematics and Computation
publication date: 2018-08-24T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 49M05
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6925030
zbMATH Keywords: bundle methods
zbMATH Keywords: proximity control
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: eigenvalue optimization
zbMATH Keywords: bilinear matrix problems
MaRDI profile type: Publication
full work available at URL: j.amc.2015.05.119
OpenAlex ID: W561477130
cites work: A nonmonotone proximal bundle method with (potentially) continuous step decisions
cites work: Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
cites work: A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
cites work: A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
cites work: Optimization and nonsmooth analysis
cites work: Q4127646
cites work: Solutions to shape and topology eigenvalue optimization problems using a homogenization method
cites work: A Stochastic Smoothing Algorithm for Semidefinite Programming
cites work: Semi-Definite Matrix Constraints in Optimization
cites work: Q4226179
cites work: Application of modem synthesis to aircraft control: Three case studies
cites work: Sensitivity analysis of all eigenvalues of a symmetric matrix
cites work: Q3141900
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: A spectral bundle method with bounds
cites work: A semidefinite programming approach to the quadratic knapsack problem
cites work: Q3964378
cites work: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
cites work: Robust control with structure perturbations
cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
cites work: Q5690370
cites work: Q4735938
cites work: An inexact spectral bundle method for convex quadratic semidefinite programming
cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
cites work: Interior-point methods: An old and new approach to nonlinear programming
cites work: Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
cites work: Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
cites work: Partially Augmented Lagrangian Method for Matrix Inequality Constraints
cites work: A bundle method for solving equilibrium problems
cites work: Inexact Bundle Methods for Two-Stage Stochastic Programming
cites work: Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
cites work: On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
cites work: Large-Scale Optimization of Eigenvalues
cites work: A second-order bundle method to minimize the maximum eigenvalue function.
cites work: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
cites work: Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
cites work: First and second order analysis of nonlinear semidefinite programs
cites work: Composite proximal bundle method
cites work: A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
cites work: Semidefinite Programming
cites work: Q4146571
DOI: 10.1016/J.AMC.2015.05.119
description: scientific article; zbMATH DE number 6925030