A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
From MaRDI portal
Publication:2301138
DOI10.1007/s10589-019-00151-4zbMath1432.90099OpenAlexW2983558147WikidataQ126836055 ScholiaQ126836055MaRDI QIDQ2301138
Enrico Bettiol, Lucas Létocart, Emiliano Traversi, Francesco Rinaldi
Publication date: 28 February 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00151-4
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-scale optimization with the primal-dual column generation method
- Fast projection onto the simplex and the \(l_1\) ball
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Interior point methods 25 years later
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A new warmstarting strategy for the primal-dual column generation method
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Cutting planes and column generation techniques with the projective algorithm
- A genetic algorithm for the multidimensional knapsack problem
- Using an interior point method for the master problem in a decomposition approach
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Equal risk bounding is better than risk parity for portfolio selection
- The quadratic shortest path problem: complexity, approximability, and solution methods
- An active set feasible method for large-scale minimization problems with bound constraints
- New developments in the primal-dual column generation technique
- A class on nonmonotone stabilization methods in unconstrained optimization
- QPLIB: a library of quadratic programming instances
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A two-stage active-set algorithm for bound-constrained optimization
- Restricted simplicial decomposition for convex constrained problems
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- Atomic Decomposition by Basis Pursuit
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- A Unifying Polyhedral Approximation Framework for Convex Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- High-Performance Computing for Asset-Liability Management
- Restricted simplicial decomposition: Computation and extensions
- A central cutting plane algorithm for the convex programming problem
- Simplicial decomposition in nonlinear programming algorithms
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- An extension of the frank and Wolfe method of feasible directions
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Convex Optimization in Signal Processing and Communications
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Location of the Maximum on Unimodal Surfaces
- Benchmarking optimization software with performance profiles.
