A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
From MaRDI portal
Publication:394386
DOI10.1007/S11424-012-0317-9zbMATH Open1305.90329OpenAlexW2098445125MaRDI QIDQ394386FDOQ394386
Authors: Mingwang Zhang 
Publication date: 27 January 2014
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-012-0317-9
Recommendations
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
- A wide neighborhood second-order predictor-corrector interior-point algorithm for semidefinite optimization with modified corrector directions
- New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
Cites Work
- PCx: an interior-point code for linear programming
- A new polynomial-time algorithm for linear programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On Mehrotra-Type Predictor-Corrector Algorithms
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Title not available (Why is that?)
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
Cited In (10)
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming
- A new second-order corrector interior-point algorithm for semidefinite programming
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- A Mehrotra-type algorithm for SDP based on a new adaptive updating technique of barrier parameter
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
Uses Software
This page was built for publication: A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394386)
