Pages that link to "Item:Q3141559"
From MaRDI portal
The following pages link to An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices (Q3141559):
Displaying 28 items.
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities (Q972166) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming (Q1290605) (← links)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Robust performance of linear parametrically varying systems using parametrically-dependent linear feedback (Q1337666) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- Explicit solutions for interval semidefinite linear programs (Q1911421) (← links)
- Global optimization for the biaffine matrix inequality problem (Q1913606) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis (Q2454715) (← links)
- A globally convergent method for solving nonlinear equations without the differentiability condition (Q2564500) (← links)
- The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
- The spectral bundle method with second-order information (Q2926057) (← links)
- Input design for linear dynamic systems using maxmin criteria (Q4225621) (← links)
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> (Q4235448) (← links)
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants (Q4504778) (← links)
- Penalty/Barrier multiplier algorthm for semidefinit programming<sup>∗</sup> (Q4514285) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
- Computation of the distance to semi-algebraic sets (Q4941311) (← links)
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods (Q4979859) (← links)
- Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method (Q6082663) (← links)
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization (Q6136653) (← links)
- Performance optimization for continuous network localization (Q6659185) (← links)
