A cutting plane algorithm for convex programming that uses analytic centers
From MaRDI portal
Recommendations
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- A new algorithm for minimizing convex functions over convex sets
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
Cites work
- A logarithmic barrier cutting plane method for convex programming
- A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A Potential Reduction Algorithm Allowing Column Generation
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- A scaling technique for finding the weighted analytic center of a polytope
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Cutting planes and column generation techniques with the projective algorithm
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 45207 (Why is no real title available?)
- scientific article; zbMATH DE number 4123531 (Why is no real title available?)
- scientific article; zbMATH DE number 4121751 (Why is no real title available?)
- scientific article; zbMATH DE number 776084 (Why is no real title available?)
- Interior-point methods for convex programming
- Matrix multiplication via arithmetic progressions
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- On the convergence of the method of analytic centers when applied to convex quadratic programs
Cited in
(48)- A filter-variable-metric method for nonsmooth convex constrained optimization
- 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
- Complexity of some cutting plane methods that use analytic centers
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- Specialized fast algorithms for IQC feasibility and optimization problems.
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
- A cutting-plane method to nonsmooth multiobjective optimization problems
- A utility theory based interactive approach to robustness in linear optimization
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- A cutting plane method from analytic centers for stochastic programming
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Active-learning a convex body in low dimensions
- A simple method for convex optimization in the oracle model
- Research on probabilistic methods for control system design
- An oracle for the discrete-time integral quadratic constraint problem
- Convex analysis in groups and semigroups: a sampler
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A randomized cutting plane method with probabilistic geometric convergence
- Efficient convex optimization with oracles
- Optimization under uncertainty with applications to design of truss structures
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming
- scientific article; zbMATH DE number 1985308 (Why is no real title available?)
- scientific article; zbMATH DE number 1488009 (Why is no real title available?)
- Predicting abnormal returns from news using text classification
- Multicommodity network flows: A survey. II: Solution methods
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Centerpoints: a link between optimization and convex geometry
- On complexity of the translational-cut algorithm for convex minimax problems
- Solving the discrete \(l_p\)-approximation problem by a method of centers
- A J-symmetric quasi-Newton method for minimax problems
- Learning lyapunov functions for hybrid systems
- A copositive framework for analysis of hybrid Ising-classical algorithms
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- A simple method for convex optimization in the oracle model
- Implementation of an oracle-structured bundle method for distributed optimization
- Accuracy certificates for convex minimization with inexact oracle
- Certifying Lyapunov stability of black-box nonlinear systems via counterexample guided synthesis
- On the volumetric path
- Efficient convex optimization requires superlinear memory
- Self-concordant barriers for convex approximations of structured convex sets
- A second-order cone cutting surface method: Complexity and application
- A variable metric method for nonsmooth convex constrained optimization
This page was built for publication: A cutting plane algorithm for convex programming that uses analytic centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922689)
