Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
From MaRDI portal
Publication:2424763
DOI10.1016/j.ejor.2019.04.004zbMath1430.90451OpenAlexW2936247735MaRDI QIDQ2424763
Jaehwan Jeong, N. Chanaka P. Edirisinghe
Publication date: 25 June 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.004
global optimizationinteger programmingnonlinear programmingconstraint aggregationlarge scale optimization
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (3)
New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints ⋮ Optimal portfolio deleveraging under market impact and margin restrictions
Cites Work
- An efficient global algorithm for a class of indefinite separable quadratic programs
- A branch and search algorithm for a class of nonlinear knapsack problems
- Approximation algorithms for indefinite quadratic programming
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Quadratic programming with one negative eigenvalue is NP-hard
- Local minima for indefinite quadratic knapsack problems
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- The nonlinear knapsack problem - algorithms and applications
- Zero duality gap in surrogate constraint optimization: a concise review of models
- On the solution of concave knapsack problems
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Efficient Production-Distribution System Design
- Surrogate Constraints Algorithm for Reliability Optimization Problems with Multiple Constraints
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact
- Computationally Related Problems
- Nonlinear Programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Quasi-Convex Programming
- Surrogate Mathematical Programming
This page was built for publication: Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
