A matrix generation approach for eigenvalue optimization
From MaRDI portal
Publication:868452
DOI10.1007/s10107-006-0727-3zbMath1171.90499OpenAlexW2021818992MaRDI QIDQ868452
Jean-Louis Goffin, Mohammad R. Oskoorouchi
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0727-3
Column generationEigenvalue optimizationAnalytic centerCutting plane techniqueSemidefinite inequality
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A new polynomial-time algorithm for linear programming
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- Numerical evaluation of SBmethod
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Multiple Cuts in the Analytic Center Cutting Plane Method
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
- An aggregate subgradient method for nonsmooth convex minimization
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- The Cutting-Plane Method for Solving Convex Programs
- A unifying framework for several cutting plane methods for semidefinite programming
- Semidefinite optimization
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Potential Reduction Algorithm Allowing Column Generation
- Large-Scale Optimization of Eigenvalues
- ARPACK Users' Guide
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A Spectral Bundle Method for Semidefinite Programming
- Polynomial Interior Point Cutting Plane Methods
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: A matrix generation approach for eigenvalue optimization