On constrained optimization by adjoint based quasi-Newton methods

DOI10.1080/1055678021000060829zbMath1065.90060OpenAlexW1972504036WikidataQ57389655 ScholiaQ57389655MaRDI QIDQ4405943

Jean-Philippe Vial, Jean-Louis Goffin

Publication date: 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1055678021000060829

zbMATH Keywords

Cutting Plane Methods Nondifferentiable Optimization Analytic Center

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonsmooth analysis (49J52) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Large-scale optimization with the primal-dual column generation method, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, Improved branching disjunctions for branch-and-bound: an analytic center approach, Using the primal-dual interior point algorithm within the branch-price-and-cut method, A branch-and-price algorithm for the capacitated facility location problem, Robust capacity assignment in telecommunications, The proximal Chebychev center cutting plane algorithm for convex additive functions, An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, Optimization under uncertainty with applications to design of truss structures, A feasible directions method for nonsmooth convex optimization, A cone constrained convex program: structure and algorithms, Distributions with maximum spread subject to Wasserstein distance constraints, Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches, A tutorial on column generation and branch-and-price for vehicle routing problems, An interior-point method for a class of saddle-point problems, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, A proximal analytic center cutting plane algorithm for solving variational inequality problems, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, An extension of Chubanov's algorithm to symmetric cones, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, Large-scale convex optimization methods for air quality policy assessment., Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach, Minimizing a stochastic convex function subject to stochastic constraints and some applications, Analytic center cutting plane method for multiple kernel learning, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A utility theory based interactive approach to robustness in linear optimization, Comparison of bundle and classical column generation, A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs, Stabilized dynamic constraint aggregation for solving set partitioning problems, Decomposition and dynamic cut generation in integer linear programming, A constraint generation algorithm for large scale linear programs using multiple-points separation, Research on probabilistic methods for control system design, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, An improved Lagrangian relaxation and dual ascent approach to facility location problems, Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, A geometric characterization of ``optimality-equivalent relaxations, Computing sharp bounds for hard clustering problems on trees, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, Unnamed Item, Chebyshev center based column generation, A note on the primal-dual column generation method for combinatorial optimization, Support vector machine classification with indefinite kernels

Uses Software

ACCPM

Cites Work