A method for solving nonlinear maximum‐problems depending on parameters
From MaRDI portal
Publication:5529079
Cited in
(8)- A reduced proximal-point homotopy method for large-scale non-convex BQP
- Nonlinear one-parametric bottleneck linear programming
- Stability of linearly constrained convex quadratic programs
- HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS
- Finding normal solutions in piecewise linear programming
- Primal and dual active-set methods for convex quadratic programming
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- PAL-Hom method for QP and an application to LP
This page was built for publication: A method for solving nonlinear maximum‐problems depending on parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5529079)