ACCPM

swMATH6707MaRDI QIDQ18789

No author found.

Related Items (58)

Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ BoxStep methods for crew pairing problems ⋮ V-shaped interval insensitive loss for ordinal classification ⋮ New Stabilization Procedures for the Cutting Stock Problem ⋮ Unnamed Item ⋮ A logarithmic barrier cutting plane method for convex programming ⋮ A Study of Indicators for Identifying Zero Variables in Interior-Point Methods ⋮ A variable metric method for nonsmooth convex constrained optimization ⋮ Decomposition and Nondifferentiable Optimization with the Projective Algorithm ⋮ Properties of the central points in linear programming problems ⋮ Solving real-world linear ordering problems using a primal-dual interior point cutting plane method ⋮ Unnamed Item ⋮ A new algorithm for minimizing convex functions over convex sets ⋮ Cutting planes and column generation techniques with the projective algorithm ⋮ A cutting plane algorithm for convex programming that uses analytic centers ⋮ A Potential Reduction Algorithm Allowing Column Generation ⋮ A cutting plane method for solving KYP-SDPs ⋮ An algorithm for bounded-error identification of nonlinear systems based on DC functions ⋮ Multiple Cuts in the Analytic Center Cutting Plane Method ⋮ Unnamed Item ⋮ Specialized fast algorithms for IQC feasibility and optimization problems. ⋮ Unnamed Item ⋮ Probabilistic Analysis of a Combined Aggregation and Math Programming Heuristic for a General Class of Vehicle Routing and Scheduling Problems ⋮ Solving combinatorial optimization problems using Karmarkar's algorithm ⋮ Unnamed Item ⋮ Using central prices in the decomposition of linear programs ⋮ A build-up variant of the logarithmic barrier method for LP ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm ⋮ A long-step, cutting plane algorithm for linear and convex programming ⋮ Building and solving large-scale stochastic programs on an affordable distributed computing system ⋮ Interior point cutting plane method for optimal power flow ⋮ Parallel implementation of a central decomposition method for solving large-scale planning problems ⋮ On constrained optimization by adjoint based quasi-Newton methods ⋮ Unnamed Item ⋮ Using selective orthonormalization to update the analytic center after addition of multiple cuts ⋮ Four Good Reasons to Use an Interior Point Solver Within a MIP Solver ⋮ Efficient management of multiple sets to extract complex structures from mathematical programs ⋮ An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming† ⋮ Positivity and linear matrix inequalities ⋮ A filter-variable-metric method for nonsmooth convex constrained optimization ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ Unnamed Item ⋮ Cutting-set methods for robust convex optimization with pessimizing oracles ⋮ On improvements to the analytic center cutting plane method ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Warm start of the primal-dual method applied in the cutting-plane scheme ⋮ Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits ⋮ A Structure-Exploiting Tool in Algebraic Modeling Languages ⋮ Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation ⋮ Acceleration of cutting-plane and column generation algorithms: Applications to network design ⋮ A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem ⋮ A two-cut approach in the analytic center cutting plane method ⋮ Unnamed Item ⋮ Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993 ⋮ An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

This page was built for software: ACCPM