Pages that link to "Item:Q1597978"
From MaRDI portal
The following pages link to Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978):
Displayed 50 items.
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process (Q2672023) (← links)
- A note on star partial order preservers on the set of all variance-covariance matrices (Q2685888) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
- The Approach of Moments for Polynomial Equations (Q2802518) (← links)
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO (Q2825271) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- Embedding methods for semidefinite programming (Q2885491) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming (Q2921914) (← links)
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)
- An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets (Q3177620) (← links)
- Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money (Q3455197) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- (Q3585652) (← links)
- Kernel-function Based Algorithms for Semidefinite Optimization (Q3632808) (← links)
- A new barrier for a class of semidefinite problems (Q3635704) (← links)
- Some Recent Developments in Spectrahedral Computation (Q4556598) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization (Q4595149) (← links)
- Symmetric Kronecker Products and Semiclassical Wave Packets (Q4598343) (← links)
- A full NT-step infeasible interior-point algorithm for semidefinite optimization (Q4603922) (← links)
- New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function (Q4622797) (← links)
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization (Q4633251) (← links)
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- (Q4915359) (← links)
- Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming (Q4916315) (← links)
- Time-Varying Semidefinite Programs (Q4958555) (← links)
- An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood (Q5031228) (← links)
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
- (Q5083070) (← links)
- Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution (Q5088656) (← links)
- A new full-NT step interior-point method for circular cone optimization (Q5147630) (← links)
- Refining the partition for multifold conic optimization problems (Q5151515) (← links)
- <i>H</i><sub>∞</sub>filter design for continuous-time systems with quantised signals (Q5172437) (← links)
- Parametric analysis of semidefinite optimization (Q5207741) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- An extension for identifying search directions for interior-point methods in linear optimization (Q5213020) (← links)
- Examples for the quantum Kippenhahn theorem (Q5216888) (← links)
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization (Q5238196) (← links)
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem (Q5243687) (← links)
- A Semidefinite Hierarchy for Containment of Spectrahedra (Q5254998) (← links)
- Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP (Q5299915) (← links)
- Limiting behavior of the central path in semidefinite optimization (Q5312757) (← links)
- Application of facial reduction to <i>H</i> <sub>∞</sub> state feedback control problem (Q5742517) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
- Preservers of partial orders on the set of all variance-covariance matrices (Q5866227) (← links)