ACCPM

swMATH6707MaRDI QIDQ18789FDOQ18789

Author name not available (Why is that?)

Cited In (58)

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

This page was built for software: ACCPM