scientific article; zbMATH DE number 5583854
From MaRDI portal
Publication:5319378
Recommendations
- A new global optimization algorithm for solving a class of nonconvex programming problems
- A Global Algorithm for Nonlinear Semidefinite Programming
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A globally convergent algorithm for nonlinearly constrained optimization problems
- A global optimization method for nonconvex separable programming problems
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A new accelerating method for globally solving a class of nonconvex programming problems
- Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
- Global optimal algorithm for linear programming problems subjected to nonlinear constraints
Cited in
(7)- A new global optimization algorithm for solving a class of nonconvex programming problems
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- A branch and bound algorithm for a class of non-convex programming problems
- A new accelerating method for globally solving a class of nonconvex programming problems
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 Q5319378)