A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
From MaRDI portal
Publication:2301138
Recommendations
- scientific article; zbMATH DE number 4045481
- On a conjugate directions method for solving strictly convex QP problem
- An interior point method for quadratic programs based on conjugate projected gradients
- Benchmarking large-scale distributed convex quadratic programming algorithms
- A class of methods for solving large, convex quadratic programs subject to box constraints
Cites work
- A central cutting plane algorithm for the convex programming problem
- A class on nonmonotone stabilization methods in unconstrained optimization
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A genetic algorithm for the multidimensional knapsack problem
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A new warmstarting strategy for the primal-dual column generation method
- A Nonmonotone Line Search Technique for Newton’s Method
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A two-stage active-set algorithm for bound-constrained optimization
- A unifying polyhedral approximation framework for convex optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- An extension of the frank and Wolfe method of feasible directions
- Atomic decomposition by basis pursuit
- Benchmarking optimization software with performance profiles.
- Convex optimization algorithms
- Convex Optimization in Signal Processing and Communications
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Cutting planes and column generation techniques with the projective algorithm
- Equal risk bounding is better than risk parity for portfolio selection
- Fast projection onto the simplex and the l₁ ball
- High-Performance Computing for Asset-Liability Management
- scientific article; zbMATH DE number 4123531 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- scientific article; zbMATH DE number 1795719 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3248677 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Interior point methods 25 years later
- Large-scale optimization with the primal-dual column generation method
- Location of the Maximum on Unimodal Surfaces
- New developments in the primal-dual column generation technique
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- QPLIB: a library of quadratic programming instances
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Restricted simplicial decomposition for convex constrained problems
- Restricted simplicial decomposition: Computation and extensions
- Simplicial decomposition in nonlinear programming algorithms
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- The quadratic shortest path problem: complexity, approximability, and solution methods
- Using an interior point method for the master problem in a decomposition approach
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
This page was built for publication: A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301138)
