Pages that link to "Item:Q923946"
From MaRDI portal
The following pages link to A new accelerating method for globally solving a class of nonconvex programming problems (Q923946):
Displaying 12 items.
- A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
- A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- A new global optimization algorithm for solving a class of nonconvex programming problems (Q1714710) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
- A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
- An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix (Q2033076) (← links)
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- (Q5319378) (← links)
