Parametric approach to a class of nonconvex global optimization problems
From MaRDI portal
Publication:3787803
Recommendations
- Publication:4946122
- On parameteric methods in global optimization
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- scientific article; zbMATH DE number 468676
- scientific article; zbMATH DE number 3851858
- scientific article; zbMATH DE number 3867040
- Approximating parameterized convex optimization problems
- Approximating parameterized convex optimization problems
- A global optimization method for nonconvex separable programming problems
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
Cites work
Cited in
(8)- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Solution of a non-linear programming problem with quadratic functions
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- Parametrische hyperbolische optimierungsprobleme mit parameters in der zielfunktion
- scientific article; zbMATH DE number 3902417 (Why is no real title available?)
- An FPTAS for a general class of parametric optimization problems
- Tight bounds for capacities
- A parametric solution algorithm for a class of rank-two nonconvex programs
This page was built for publication: Parametric approach to a class of nonconvex global optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787803)