Pages that link to "Item:Q4405943"
From MaRDI portal
The following pages link to On constrained optimization by adjoint based quasi-Newton methods (Q4405943):
Displayed 44 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- Optimization under uncertainty with applications to design of truss structures (Q373938) (← links)
- A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
- A cone constrained convex program: structure and algorithms (Q384210) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- Robust capacity assignment in telecommunications (Q867429) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- Computing sharp bounds for hard clustering problems on trees (Q1028427) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Support vector machine classification with indefinite kernels (Q1043851) (← links)
- An interior-point method for a class of saddle-point problems (Q1411479) (← links)
- Large-scale convex optimization methods for air quality policy assessment. (Q1428124) (← links)
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach (Q1433167) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system (Q1789576) (← links)
- A proximal analytic center cutting plane algorithm for solving variational inequality problems (Q1952872) (← links)
- Minimizing a stochastic convex function subject to stochastic constraints and some applications (Q2229571) (← links)
- Analytic center cutting plane method for multiple kernel learning (Q2248558) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- Distributions with maximum spread subject to Wasserstein distance constraints (Q2422610) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- A note on the primal-dual column generation method for combinatorial optimization (Q2840728) (← links)
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver (Q4685752) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- (Q5389783) (← links)