A study of search directions in primal-dual interior-point methods for semidefinite programming
From MaRDI portal
Publication:4504774
DOI10.1080/10556789908805745zbMath0971.90109OpenAlexW1989395545MaRDI QIDQ4504774
Publication date: 14 September 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/9089
Related Items
Credible autocoding of convex optimization algorithms, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, Matrix Relaxations in Combinatorial Optimization, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, An interior-point algorithm for semidefinite least-squares problems., Efficient solution of second order cone program for model predictive control, A boundary point method to solve semidefinite programs, The spectral bundle method with second-order information, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A new smooth NCP function for solving semidefinite nonlinear complementarity problems, A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming, Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture, Semidefinite programming for the educational testing problem, Interior Point Methods for Nonlinear Optimization, Inexact non-interior continuation method for monotone semidefinite complementarity problems, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Semidefinite programming for discrete optimization and matrix completion problems, On self-regular IPMs (with comments and rejoinder), Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, An efficient parameterized logarithmic kernel function for semidefinite optimization, A robust algorithm for semidefinite programming, Solving semidefinite programs using preconditioned conjugate gradients, A new primal-dual path-following interior-point algorithm for semidefinite optimization, On the connections between semidefinite optimization and vector optimization, An interior point-proximal method of multipliers for linear positive semi-definite programming, Similarity and other spectral relations for symmetric cones, Exploiting special structure in semidefinite programming: a survey of theory and applications, Inexact non-interior continuation method for solving large-scale monotone SDCP, Polynomial primal-dual cone affine scaling for semidefinite programming, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Interior-point methods, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Semidefinite programming, A primal-dual interior point method for large-scale free material optimization, A primal–dual regularized interior-point method for semidefinite programming
Uses Software
Cites Work
- Concavity of certain maps on positive definite matrices and applications to Hadamard products
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
- Semidefinite programming in combinatorial optimization
- Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On the Implementation of a Primal-Dual Interior Point Method
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
