New Bundle Methods for Solving Lagrangian Relaxation Dual Problems

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Journal of Optimization Theory and Applications

• Publication date

  2002-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1014839227049
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization

  1998cited by this paper
• Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems

  1998influential reference
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation

  1997cited by this paper
• An optimization-based algorithm for job shop scheduling

  1997cited by this paper
• Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization

  1996cited by this paper
• Nonlinear Programming

  1995cited by this paper
• Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities

  1995cited by this paper
• Convex analysis and minimization algorithms

  1993cited by this paper
• A practical approach to job-shop scheduling problems

  1993cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• Validation of subgradient optimization

  1974cited by this paper
• Applied Dynamic Programming

  1964cited by this paper
• Dynamic Programming

  1957cited by this paper

• LOTUS: A Warm-Start Framework for Powering Dual Decomposition in Large-Scale Two-Stage Stochastic Programs

  2026cites this paper
• Lagrangian Relaxation for Mixed-Integer Linear Programming: Importance, Challenges, Recent Advancements, and Opportunities

  2023cites this paper
• Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities

  2023cites this paper
• A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

  2023influential citation
• The p-Lagrangian relaxation for separable nonconvex MIQCQP problems

  2022cites this paper
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid

  2021cites this paper
• An efficient algorithm for the precedence constraint knapsack problem with reference to large-scale open-pit mining pushback design

  2021cites this paper
• A Lagrangean decomposition optimization approach for long-term planning, scheduling and control

  2020cites this paper
• The p -Lagrangian relaxation for nonconvex MIQCQP problems with complicating constraints

  2020cites this paper
• Mathematical Optimization for Routing and Logistic Problems

  2016cites this paper
• New filtering for AtMostNValue and its weighted variant: A Lagrangian approach

  2015cites this paper
• Exact and Heuristic Methods for the Resource-Constrained Net Present Value Problem

  2015cites this paper
• A New Steepest Descent Differential Inclusion-Based Method for Solving General Nonsmooth Convex Optimization Problems

  2013cites this paper
• A Lagrangean decomposition approach for oil supply chain investment planning under uncertainty with risk considerations

  2013cites this paper
• An improved Lagrangian relaxation method for maximising the net present value of large resource-constrained projects [Abstract]

  2012cites this paper
• Solving dual problems using a coevolutionary optimization algorithm

  2012cites this paper
• Maximising the Net Present Value of Large Resource-Constrained Projects

  2012cites this paper
• A Revised Subgradient Method for Solving the Dual Problem of Hydrothermal Scheduling

  2011cites this paper
• Decomposition methods for operations scheduling problem in a combined heat and power plant

  2011cites this paper
• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness

  2010cites this paper
• Convex optimization theory

  2010cites this paper
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems

  2009cites this paper
• Convex Optimization Theory

  2009cites this paper
• Multi-objective generation scheduling with hybrid energy resources

  2007cites this paper
• A Facility Location Model for Bidirectional Flows

  2007cites this paper
• Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs

  2005cites this paper
• Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming

  2005cites this paper
• About Lagrangian Methods in Integer Optimization

  2005cites this paper
• Computational Integer Programming and Cutting Planes

  2005cites this paper
• On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems

  2003cites this paper