A Homogenized Cutting Plane Method
ثبت نشده
چکیده
منابع مشابه
A Homogenized Cutting Plane Method to Solve the Convex Feasibility Problem
We present a cutting plane algorithm for the feasibility problem that uses a homogenized self-dual approach to regain an approximate center when adding a cut. The algorithm requires a fully polynomial number of Newton steps. One novelty in the analysis of the algorithm is the use of a powerful proximity measure which is widely used in interior point methods but not previously used in the analys...
متن کاملComparison of two integration schemes for a micropolar plasticity model
Micropolar plasticity provides the capability to carry out post-failure simulations of geo-structures due to microstructural considerations and embedded length scale in its formulation. An essential part of the numerical implementation of a micropolar plasticity model is the integration of the rate constitutive equations. Efficiency and robustness of the implementation hinge on the type of int...
متن کاملLocalization and Cutting-Plane Methods
4 Some specific cutting-plane methods 12 4.1 Bisection method on R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4.2 Center of gravity method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.3 MVE cutting-plane method . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.4 Chebyshev center cutting-plane method . . . . . . . . . . . . . . . . . . . . . 16 4.5 ...
متن کاملA unifying framework for several cutting plane methods for semidefinite programming
Cutting plane methods provide the means to solve large scale semidefinite programs (SDP) cheaply and quickly. We give a survey of various cutting plane approaches for SDP in this paper. These cutting plane approaches arise from various perspectives, and include techniques based on interior point cutting plane approaches, and an approach which mimics the simplex method for linear programming. We...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کامل