A note on composite concave quadratic programming
From MaRDI portal
Publication:1306393
Recommendations
- On convex quadratic programs with linear complementarity constraints
- A note on a quadratic formulation for linear complementarity problems
- Algorithmic and computational aspects of composite concave programming
- scientific article; zbMATH DE number 3920195
- On quadratic and complete quadratic problems of convex programming
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Composite convex programs
- A class of quadratic programs with linear complementarity constraints
- scientific article; zbMATH DE number 757652
- The complementary basis method for problems of convex quadratic programming
Cites work
- scientific article; zbMATH DE number 4041131 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 53073 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3634009 (Why is no real title available?)
- scientific article; zbMATH DE number 3224200 (Why is no real title available?)
- Algorithmic and computational aspects of composite concave programming
- An Iterative Approach to Goal Programming
- Complementary pivot theory of mathematical programming
- Generalized linear programming and sensitivity analysis techniques
- Handling soft constraints via composite concave programming
- Linear multiobjective programming
- Optimization on low rank nonconvex structures
- Programming with linear fractional functionals
- Strictly Concave Parametric Programming, Part I: Basic Theory
- Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
- The Cutting-Plane Method for Solving Convex Programs
- The simplex method as a global optimizer: A \(C\)-programming perspective
Cited in
(8)- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- Handling soft constraints via composite concave programming
- scientific article; zbMATH DE number 1775264 (Why is no real title available?)
- A note on a quadratic formulation for linear complementarity problems
- HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Algorithmic and computational aspects of composite concave programming
- Global minimization algorithms for concave quadratic programming problems
This page was built for publication: A note on composite concave quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306393)