On self-regular IPMs (with comments and rejoinder)

DOI10.1007/BF02578956zbMATH Open1138.90039OpenAlexW2005484777MaRDI QIDQ1769946FDOQ1769946

Authors: Maziar Salahi, Renata Sotirov, Tamás Terlaky 

Publication date: 4 April 2005

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02578956

Recommendations

• scientific article; zbMATH DE number 1019324
• The complexity of self-regular proximity based infeasible IPMs
• scientific article; zbMATH DE number 3927143
• scientific article; zbMATH DE number 1862745
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• The self-normalized Donsker theorem revisited
• scientific article; zbMATH DE number 4768
• Advances on strictly \(\varDelta \)-modular IPs
• Self-reference and fixed points: A discussion and an extension of Lawvere's theorem
• Self-stabilization with r-Operators Revisited

zbMATH Keywords

polynomial complexitysemidefinite optimizationconic optimizationprimal-dual interior-point methodLinear optimizationself-regular proximity function

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• 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
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new and efficient large-update interior-point method for linear optimization
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Title not available (Why is that?)
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Title not available (Why is that?)
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• Applications of second-order cone programming
• A mathematical view of interior-point methods in convex optimization
• An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
• Title not available (Why is that?)
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Title not available (Why is that?)
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Smoothing functions for second-order-cone complementarity problems
• Title not available (Why is that?)
• Euclidean Jordan algebras and interior-point algorithms
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
• A Jordan-algebraic approach to potential-reduction algorithms
• Complementarity and nondegeneracy in semidefinite programming
• Title not available (Why is that?)
• Semidefinite programming relaxations for the quadratic assignment problem
• 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
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• On the Nesterov--Todd Direction in Semidefinite Programming
• Title not available (Why is that?)
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Robust filtering via semidefinite programming with applications to target tracking
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• An attractor-repeller approach to floorplanning
• Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
• Robust Control via Sequential Semidefinite Programming
• Title not available (Why is that?)
• Equivalent displacement based formulations for maximum strength truss topology design
• Title not available (Why is that?)
• Semidefinite programming in combinatorial optimization
• Convergence behavior of interior-point algorithms
• Symmetric primal-dual path-following algorithms for semidefinite programming
• A dynamic large-update primal‐dual interior-point method for linear optimization
• An adaptive self-regular proximity-based large-update IPM for LO
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• Title not available (Why is that?)
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
• The complexity of self-regular proximity based infeasible IPMs

Cited In (8)

• Title not available (Why is that?)
• A dynamic large-update primal‐dual interior-point method for linear optimization
• An adaptive self-regular proximity-based large-update IPM for LO
• Self-regular functions and new search directions for linear and semidefinite optimization
• The complexity of self-regular proximity based infeasible IPMs
• Interior point methods with self-regular proximities
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities

Uses Software

• McIPM

This page was built for publication: On self-regular IPMs (with comments and rejoinder)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769946)