scientific article; zbMATH DE number 3920199
[For the entire collection see Zbl 0571.00016.] For nonlinear parametric programming problems \(P(\lambda)=\min \{f(x,\lambda):\) \(x\in M(\lambda)\}\), \(\lambda\in \Lambda\), the structures in the parameter space \(\Lambda\) have been proved to be very complicated and inconvenient for usual applications. A method is presented in the paper for the illustrative case of quadratic programming which allows to find structures in \(\Lambda\) being easy to survey also for some classes of nonlinear problems (in particular for problems with an objective function which is a linear function of their coefficients). To simplify the discussion, problems with fixed feasible convex solution sets M in Euclidean spaces are considered. The domains of local stationarity are described and a classification of stationary points of local and global optima is given. The procedure is illustrated by an example.
- On solving parametric multiobjective quadratic programs with parameters in general locations
- A quadratic programming problem arising from the p-version for obstacle problems
- scientific article; zbMATH DE number 3850845 (Why is no real title available?)
- Quadratic geometric programming with application to machining economics
- scientific article; zbMATH DE number 3916039 (Why is no real title available?)
- scientific article; zbMATH DE number 3920224 (Why is no real title available?)
- A unified approach to one-parametric general quadratic programming
- scientific article; zbMATH DE number 3941272 (Why is no real title available?)
- scientific article; zbMATH DE number 3956833 (Why is no real title available?)
- scientific article; zbMATH DE number 4025168 (Why is no real title available?)
- scientific article; zbMATH DE number 4068621 (Why is no real title available?)
- Stationary point sets: convex quadratic optimization is universal in nonlinear optimization
- One-parametric linear-quadratic optimization problems
- Convex parametric piecewise quadratic optimization: theory and algorithms
- On the facet-to-facet property of solutions to convex parametric quadratic programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694993)