A method for solving some optimization problems with bounds on variables (Q260512): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s12597-013-0163-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2063729230
@@ Property / OpenAlex ID: W2063729230 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-Concave Programming
@@ Property / cites work: Quasi-Concave Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear Programming
@@ Property / cites work: Nonlinear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
+Normal rank
@@ Property / cites work @@
+A Review of Quasi-Convex Functions
@@ Property / cites work: A Review of Quasi-Convex Functions / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for bound constrained optimization problems without derivatives
+Normal rank
@@ Property / cites work @@
+A bundle-filter method for nonsmooth convex constrained optimization
+Normal rank
@@ Property / cites work @@
+Pattern Search Algorithms for Bound Constrained Minimization
+Normal rank
@@ Property / cites work @@
+On the Convergence of the Multidirectional Search Algorithm
+Normal rank
@@ Property / cites work @@
+A particle swarm pattern search method for bound constrained global optimization
+Normal rank