On constrained optimization by adjoint based quasi-Newton methods
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1488009
- Complexity of some cutting plane methods that use analytic centers
- scientific article; zbMATH DE number 503170
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
Cites work
- Analysis of iterative methods for saddle point problems: A unified approach
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- scientific article; zbMATH DE number 1269473 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 1456803 (Why is no real title available?)
- Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians
- Numerical Optimization
- The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
Cited in
(50)- 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
- Support vector machine classification with indefinite kernels
- An interior-point method for a class of saddle-point problems
- Large-scale convex optimization methods for air quality policy assessment.
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- An extension of Chubanov's algorithm to symmetric cones
- A utility theory based interactive approach to robustness in linear optimization
- 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
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- 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
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- Research on probabilistic methods for control system design
- Distributions with maximum spread subject to Wasserstein distance constraints
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Comparison of bundle and classical column generation
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Decomposition and dynamic cut generation in integer linear programming
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Large-scale optimization with the primal-dual column generation method
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- A note on the primal-dual column generation method for combinatorial optimization
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
- 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
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- 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
- scientific article; zbMATH DE number 1264396 (Why is no real title available?)
- scientific article; zbMATH DE number 503170 (Why is no real title available?)
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- scientific article; zbMATH DE number 1488009 (Why is no real title available?)
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- scientific article; zbMATH DE number 6027005 (Why is no real title available?)
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Global solution algorithms for DC programming via polyhedral approximations of convex functions
- Chebyshev center based column generation
- A branch-and-price algorithm for the capacitated facility location problem
- Robust capacity assignment in telecommunications
This page was built for publication: On constrained optimization by adjoint based quasi-Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405943)
