On the classical logarithmic barrier function method for a class of smooth convex programming problems
From MaRDI portal
Publication:1321158
DOI10.1007/BF00940075zbMath0794.90044OpenAlexW1972639694MaRDI QIDQ1321158
Cornelis Roos, Dick den Hertog, Tamás Terlaky
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940075
Related Items
Controlled dual perturbations for central path trajectories in geometric programming, A globally convergent primal-dual interior point algorithm for convex programming, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, Volumetric path following algorithms for linear programming, Nonlinear coordinate representations of smooth optimization problems, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A combined homotopy interior point method for convex nonlinear programming, The Newton modified barrier method for QP problems, Interior-point methods for nonlinear complementarity problems, Feasible method for generalized semi-infinite programming, On the complexity of linear programming under finite precision arithmetic, Long-step path-following algorithm for quantum information theory: some numerical aspects and applications, Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions, Impproving the rate of convergence of the logarithmic barrier function method, Continuous relaxations for Constrained Maximum-Entropy Sampling, A long-step barrier method for convex quadratic programming, Computing Maximum Likelihood Estimators of Convex Density Functions, Interior-point methods for convex programming, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, A continuation method for solving convex programming problemsviafischer reformulation, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization, Condition measures and properties of the central trajectory of a linear program, Improving complexity of structured convex optimization problems using self-concordant barriers, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems, An interior point parameterized central path following algorithm for linearly constrained convex programming, Global linear convergence of a path-following algorithm for some monotone variational inequality problems
Cites Work
- A new polynomial-time algorithm for linear programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm, based on Newton's method, for linear programming
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A duality theorem for non-linear programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
