Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127865202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact solution of a facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the One-Dimensional Facility Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably near-optimal solutions for very large single-row facility layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Center Cutting Plane Approach for Conic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deux problèmes d'affectation non linéaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of an interior-point cutting plane method within a branch-and-price algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interior-Point Warmstarts for Linear and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm start of the primal-dual method applied in the cutting-plane scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization With the Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient models for the facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conversion of an SDP having free variables into the standard form SDP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying framework for several cutting plane methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5717954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving A One-Dimensional Space Allocation Problem With Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free variables in interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Interior Point Cutting Plane Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems using Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and second-order methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analytic Center Cutting Plane Method with Semidefinite Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-order cone cutting surface method: Complexity and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cone-LP's and semidefinite programs: Geometry and a simplex-type method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Dimensional Space Allocation: An Ordering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interior-point revolution in optimization: History, recent developments, and lasting consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm-Start Strategies in Interior-Point Methods for Linear Programming / rank
 
Normal rank

Latest revision as of 20:33, 11 July 2024

scientific article
Language Label Description Also known as
English
Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
scientific article

    Statements

    Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (English)
    0 references
    0 references
    26 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers