An interior method for nonconvex semidefinite programs
type: Item
instance of: scholarly article
title: An interior method for nonconvex semidefinite programs
zbMATH Open document ID: 1035.90055
DOI: 10.1023/A:1011562523132
author: Florian Jarre
published in: Optimization and Engineering
publication date: 2003-03-12T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 1880465
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: semidefinite program
zbMATH Keywords: predictor corrector method
zbMATH Keywords: trust region method
MaRDI profile type: Publication
cites work: Optimal design of trusses under a nonconvex global buckling constraint
cites work: A projected gradient algorithm for solving the maxcut SDP relaxation
cites work: Approximate solution of the trust region problem by minimization over two-dimensional subspaces
cites work: A trust region method based on interior point techniques for nonlinear programming.
cites work: Q3681854
cites work: On the Optimal Design of Columns Against Buckling
cites work: A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
cites work: A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization
cites work: Q5588268
cites work: Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
cites work: An interior-point method for multifractional programs with convex constraints
cites work: Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
cites work: Q3840106
cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
cites work: Optimal ellipsoidal approximations around the analytic center
cites work: Optimal Truss Design by Interior-Point Methods
cites work: A Practical Interior-Point Method for Convex Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: Free material optimization
cites work: Q3840112
cites work: An LMI-based algorithm for designing suboptimal static \(\mathcal H_2/\mathcal H_\infty\) output feedback controllers
cites work: On the use of directions of negative curvature in a modified newton method
cites work: Computing a Trust Region Step
cites work: Q4324980
cites work: Large-Scale Optimization of Eigenvalues
cites work: Q3837885
cites work: Multiobjective H/sub 2//H/sub ∞/ control
cites work: Q3807887
cites work: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
cites work: Q3738934
cites work: Proximal interior point approach in convex programming (ill-posed problems)*†
cites work: Generalization of primal-dual interior-point methods to convex optimization problems in conic form
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: The role of linear objective functions in barrier methods
full work available at URL: a:1011562523132
OpenAlex ID: W2224084562
description: scientific article; zbMATH DE number 1880465