Some applications of optimization in matrix theory

No abstract is available for this paper.

• Publication year

  1981

• Venue

  Linear Algebra and its Applications

• Publication date

  1981-10-01

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1016/0024-3795(81)90143-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Regularizing the Abstract Convex Program

  1981cited by this paper
• Characterization of optimality for the abstract convex program with finite dimensional range

  1981cited by this paper
• Cones of diagonally dominant matrices

  1975cited by this paper
• Geometric Functional Analysis and Its Applications

  1975cited by this paper
• Generalized inverses: theory and applications

  1974cited by this paper
• Mathematical Programming over Cones

  1973cited by this paper
• Cones, matrices and mathematical programming

  1973cited by this paper
• Linear equations over cones with interior: a solvability theorem with applications to matrix theory

  1973cited by this paper
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory☆

  1969cited by this paper
• Optimization by Vector Space Methods

  1968cited by this paper
• Ordered topological vector spaces

  1967cited by this paper

• Approximation Algorithms

  2021cites this paper
• Graphs and Geometry

  2019cites this paper
• Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form

  2018influential citation
• A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs

  2017cites this paper
• The Many Faces of Degeneracy in Conic Optimization

  2017cites this paper
• The Orthogonal Complement of Faces for Cones Associated with the Cone of Positive Semidefinite Matrices

  2015cites this paper
• Finding The Nearest Valid Covariance Matrix: A Fx Market Case

  2014cites this paper
• Geometric representations of graphs

  2014cites this paper
• On Closedness Conditions, Strong Separation, and Convex Duality

  2013cites this paper
• Chapter 1 Preprocessing and Regularization for Degenerate Semidefinite Programs

  2013cites this paper
• Preprocessing and Regularization for Degenerate Semidefinite Programs

  2013cites this paper
• Embedding methods for semidefinite programming

  2012cites this paper
• FACULTY OF MATHEMATICS, PHYSICS AND INFORMATICS

  2012cites this paper
• Strong duality and minimal representations for cone optimization

  2012cites this paper
• Preprocessing and Reduction for Degenerate Semidefinite Programs

  2011cites this paper
• New Approaches to Protein NMR Automation

  2011cites this paper
• The minimal cone for conic linear programming

  2011influential citation
• Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization

  2010cites this paper
• Discrete and Continuous: Two Sides of the Same?

  2010cites this paper
• Duality formulations in semidefinite programming

  2010cites this paper
• On some fundamental properties of structural topology optimization problems

  2010cites this paper
• Understanding linear semi-infinite programming via linear programming over cones

  2010cites this paper
• Self-Dual Embedding for SDP Using ELSD and its Lagrangian Dual

  2010cites this paper
• Semidefinite and Cone Programming Bibliography/Comments

  2009cites this paper
• SOME APPLICATIONS OF SEMIDEFINITE OPTIMIZATION FROM AN OPERATIONS RESEARCH VIEWPOINT

  2009cites this paper
• Eigenvalues of graphs

  2007cites this paper
• New Constraint Qualification and Conjugate Duality for Composed Convex Optimization Problems

  2007influential citation
• Semidefinite Programming and Graph Partitioning with Preferences

  2007cites this paper
• Semideenite Programming

  2007cites this paper
• A Short Course on Semidefinite Programming ( in order of appearance )

  2004cites this paper
• Interior-point methods

  2004cites this paper
• Mixed semidefinite and second-order cone optimization approach for the Hankel Matrix approximation problem

  2003cites this paper
• Semidefinite programming duality and linear time-invariant systems

  2003cites this paper
• Semidefinite Programs and Combinatorial Optimization

  2003cites this paper
• Semidefinite programming

  2002cites this paper
• A Subspace Semidefinite Programming for Spectral Graph Partitioning

  2002cites this paper
• Approximation Algorithms

  2001cites this paper
• Introduction to Convex and Quasiconvex Analysis

  2001cites this paper
• Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints

  2001cites this paper
• Central Region Method

  2000cites this paper
• 1 DUALITY , OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS

  2000cites this paper
• DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS

  2000cites this paper
• Graph rigidity via Euclidean distance matrices

  2000cites this paper
• Handbook of Semidefinite Programming

  2000cites this paper
• Semidefinite programming duality and linear system theory: connections and implications for computation

  1999cites this paper
• Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming

  1999cites this paper
• Semidefinite programming and combinatorial optimization

  1999cites this paper
• Semidefinite programming for assignment and partitioning problems

  1998cites this paper
• Copositive realxation for genera quadratic programming

  1998cites this paper
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues

  1998cites this paper
• Semidefinite Programming Relaxations for the Quadratic Assignment Problem

  1998cites this paper
• Semideenite Programming and Combinatorial Optimization

  1998cites this paper
• Presolving for Semide nite Programs Without ConstraintQuali cationsGerald

  1998cites this paper
• Strong Duality for Semidefinite Programming

  1997cites this paper
• On the Rank of Extreme Matrices in Semideenite Programs and the Multiplicity of Optimal Eigenvalues

  1997cites this paper
• A Bibliography of Publications in Linear Algebra and its Applications: 1980{1989

  1997cites this paper
• An exact duality theory for semidefinite programming and its complexity implications

  1997cites this paper
• Positive definite solutions of the nonstrict Lyapunov inequality

  1997cites this paper
• Duality Results for Conic Convex Programming 1

  1997influential citation
• A semidefinite framework for trust region subproblems with applications to large scale minimization

  1997cites this paper
• Cone-lp's and Semideenite Programs: Geometry and a Simplex-type Method

  1996cites this paper
• EXPLICIT SOLUTIONS FOR INTERVAL SEMIDEFINITE LINEAR PROGRAMS

  1996influential citation
• Cone-LP's and Semidefinite Programs: Geometry

  1996cites this paper
• Duality and Self-Duality for Conic Convex Programming

  1996influential citation
• An Interior-Point Method for Semidefinite Programming

  1996cites this paper
• Semidefinite Programming

  1996cites this paper
• A recipe for semidefinite relaxation for (0,1)-quadratic programming

  1995cites this paper
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

  1995cites this paper
• Some geometric results in semidefinite programming

  1995cites this paper
• A Recipe for Semidefinite Relaxation for

  1995cites this paper
• Nonpolyhedral Relaxations of Graph-Bisection Problems

  1995cites this paper
• Max-min eigenvalue problems, primal-dual Interior point algorithms, and Trust region subproblemst

  1995cites this paper
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

  1995cites this paper
• .879-approximation algorithms for MAX CUT and MAX 2SAT

  1994cites this paper
• An Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming

  1994cites this paper
• Nonpolyhedral Relaxations of Graph-bisection Problems 3 Visitor of the Dimacs Special Year in Combinatorial Optimization. Y the Second Author Acknowledges Partial Nancial Support from Thèchristian Doppler Labor Diskrete Optimierung'

  1993cites this paper
• Generalizations of Slater's constraint qualification for infinite convex programs

  1992cites this paper
• A Recipe for Semide nite Relaxation for ( 0 , 1 )-Quadratic ProgrammingS

  1992cites this paper
• A simple constraint qualification in infinite dimensional programming

  1986cites this paper
• Hilbert-Schmidt approximation problems arising in quantum chemistry

  1984cites this paper
• Introduction to Convex and Quasiconvex Analysis

  year unknowncites this paper
• Duality for Semidefinite Programming, Sdp Duality

  year unknowncites this paper
• Konrad-Zuse-Zentrum f ¨ur Informationstechnik Berlin

  year unknowncites this paper
• Background Material

  year unknowncites this paper