Approximating optimal solutions to biconvex parametric programs
From MaRDI portal
Cites work
- A first course in numerical methods
- A Multiresolution Approximation Method for Fast Explicit Model Predictive Control
- Advancing parametric optimization. On multiparametric linear complementarity problems with parameters in general locations
- An algorithm for approximate multiparametric convex programming
- An objective penalty function method for biconvex programming
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Convergence of Adaptive Finite Element Methods
- Convergence of Adaptive Finite Element Methods for General Second Order Linear Elliptic PDEs
- scientific article; zbMATH DE number 5993473 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Inequalities for Stochastic Nonlinear Programming Problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Long and Thin Triangles Can Be Good for Linear Interpolation
- On solving parametric multiobjective quadratic programs with parameters in general locations
- Optimal estimates for the linear interpolation error on simplices
- Random symmetric matrices are almost surely nonsingular.
- Robust optimization
- Sensitivity analysis for nonlinear programming using penalty methods
- Sensitivity and stability analysis for nonlinear programming
- Spectral Finite-Element Methods for Parametric Constrained Optimization Problems
- The Error in Linear Interpolation at the Vertices of a Simplex
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- The Mathematical Theory of Finite Element Methods
Cited in
(1)
This page was built for publication: Approximating optimal solutions to biconvex parametric programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968761)