Complexity estimates of some cutting plane methods based on the analytic barrier
From MaRDI portal
Publication:1922694
DOI10.1007/BF01585556zbMath0857.90103WikidataQ92953184 ScholiaQ92953184MaRDI QIDQ1922694
Publication date: 18 September 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
rate of convergencenonsmooth optimizationself-concordant functionscutting plane methodsefficiency estimatesanalytic barrier
Related Items
Complexity of some cutting plane methods that use analytic centers, Long-step strategies in interior-point primal-dual methods, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Interior-point methods: An old and new approach to nonlinear programming, An analytic center cutting plane method for pseudomonotone variational inequalities, A cutting plane method from analytic centers for stochastic programming, A conflict-directed approach to chance-constrained mixed logical linear programming, A \(J\)-symmetric quasi-Newton method for minimax problems, Learning lyapunov functions for hybrid systems, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, Specialized fast algorithms for IQC feasibility and optimization problems., Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems, A utility theory based interactive approach to robustness in linear optimization, Comparison of bundle and classical column generation, On solving large-scale finite minimax problems using exponential smoothing, Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms, Solving the discrete \(l_p\)-approximation problem by a method of centers, Non-Euclidean restricted memory level method for large-scale convex optimization, Research on probabilistic methods for control system design, Essentials of numerical nonsmooth optimization, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Efficiency of proximal bundle methods, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, An analytic center cutting plane algorithm for finding equilibrium points, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Essentials of numerical nonsmooth optimization, About Lagrangian methods in integer optimization
Cites Work
- A new polynomial-time algorithm 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
- A new algorithm for minimizing convex functions over convex sets
- A cutting plane algorithm for convex programming that uses analytic centers
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Potential Reduction Algorithm Allowing Column Generation
- Location of the Maximum on Unimodal Surfaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
