On self-regular IPMs (with comments and rejoinder)
From MaRDI portal
Publication:1769946
DOI10.1007/BF02578956zbMath1138.90039OpenAlexW2005484777MaRDI QIDQ1769946
Renata Sotirov, Tamás Terlaky, Maziar Salahi
Publication date: 4 April 2005
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02578956
Linear optimizationsemidefinite optimizationpolynomial complexityconic optimizationprimal-dual interior-point methodself-regular proximity function
Semidefinite programming (90C22) Linear programming (90C05) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence behavior of interior-point algorithms
- A new polynomial-time algorithm for linear programming
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- Applications of second-order cone programming
- Symmetric primal-dual path-following algorithms for semidefinite programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Semidefinite programming in combinatorial optimization
- Complementarity and nondegeneracy in semidefinite programming
- Euclidean Jordan algebras and interior-point algorithms
- Semidefinite programming relaxations for the quadratic assignment problem
- An attractor-repeller approach to floorplanning
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- The complexity of self-regular proximity based infeasible IPMs
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Robust Filtering via Semidefinite Programming with Applications to Target Tracking
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Equivalent displacement based formulations for maximum strength truss topology design
- On the Nesterov--Todd Direction in Semidefinite Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- 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
- A dynamic large-update primal‐dual interior-point method for linear optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- User'S guide To Lipsol linear-programming interior point solvers V0.4
- Robust Control via Sequential Semidefinite Programming
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- An adaptive self-regular proximity-based large-update IPM for LO
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A Jordan-algebraic approach to potential-reduction algorithms
