On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs N-simplex

DOI10.1007/S11590-015-0866-7MaRDI QIDQ5963696zbMATHOpenAlexFDO

Authors Rouhollah Tavakoli

Publication date 23 February 2016

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-015-0866-7

zbMATH Keywords

quadratic programmingconvex optimizationalgorithmknapsack problemnumerical experimentlinearly constrained optimizationtime-linear algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• On the continuous quadratic knapsack problem
• A Newton's method for the continuous quadratic knapsack problem
• On linear-time algorithms for the continuous quadratic Knapsack problem
• scientific article; zbMATH DE number 6263683
• Variable fixing algorithms for the continuous quadratic Knapsack problem

Cites work

• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Convex Approach to Minimal Partitions
• A MultiPhase Field Concept: Numerical Simulations of Moving Phase Boundaries and Multiple Junctions
• A New Active Set Algorithm for Box Constrained Optimization
• A nonmonotone spectral projected gradient method for large-scale topology optimization problems
• A phase field concept for multiphase systems
• ALLEN–CAHN SYSTEMS WITH VOLUME CONSTRAINTS
• Active contours without edges
• Alternating projection methods.
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• Completely convex formulation of the Chan-Vese image segmentation model
• Continuous multiclass labeling approaches and algorithms
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Minimal interface criterion for phase transitions in mixtures of Cahn- Hilliard fluids
• Multimaterial structural topology optimization with a generalized Cahn-Hilliard model of multiphase transition
• Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• On linear-time algorithms for the continuous quadratic Knapsack problem
• On the continuous quadratic knapsack problem
• Phase-field approaches to structural topology optimization
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Variable fixing algorithms for the continuous quadratic Knapsack problem

Cited in

(2)

• ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables

Describes a project that uses

Uses Software

• Matlab
• Mosek
• topopt_multi

This page was built for publication: On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963696)