A bundle method for efficiently solving large structured linear matrix inequalities

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334)

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ACC.2000.876732
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Spectral Bundle Method for Semidefinite Programming

  1999influential reference
• Nonsmooth Algorithms to Solve Semidefinite Programs

  1999cited by this paper
• ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods

  1998cited by this paper
• Exploiting structure in a projective algorithm for solving strict linear matrix inequalities

  1998cited by this paper
• Exploiting sparsity in primal-dual interior-point methods for semidefinite programming

  1997cited by this paper
• A primal—dual potential reduction method for problems involving matrix inequalities

  1995cited by this paper
• A Time-Domain Approach to Model Validation

  1992cited by this paper
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results

  1992cited by this paper
• Proximity control in bundle methods for convex nondifferentiable minimization

  1990cited by this paper
• Optimization And Nonsmooth Analysis

  1983cited by this paper

• Small signal stability criteria for descriptor form power network model

  2018cites this paper
• A Nonsmooth Nonlinear Programming Based Predictive Control for Mechanical Servo Systems with Backlash‐like Hysteresis

  2018cites this paper
• A Subspace Method for Large-Scale Eigenvalue Optimization

  2015cites this paper
• An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming.

  2012influential citation
• An inexact spectral bundle method for convex quadratic semidefinite programming

  2011influential citation
• Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods

  2005cites this paper
• SPECTRAL BUNDLE METHODS FOR NON-CONVEX MAXIMUM EIGENVALUE FUNCTIONS. PART 1: FIRST-ORDER METHODS

  2005cites this paper
• Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods

  2005cites this paper
• Fastest Mixing Markov Chain on a Graph

  2004cites this paper
• New concepts of optimizing unit commitment and economic load dispatch costs in large scale power systems

  2003cites this paper
• New concepts of costs optimization for thermal scheduling

  2003cites this paper
• A bundle method for solving the fixed order control problem

  2002cites this paper
• An inexact bundle method for solving large structured linear matrix inequalities

  2001cites this paper
• Efficient Computation of the Maximum Eigenvalue of Large Symmetric Matrices

  2000cites this paper
• Solving large structured semidefinite programs using an inexact spectral bundle method

  2000influential citation