Pages that link to "Item:Q1181733"
From MaRDI portal
The following pages link to An analytical approach to global optimization (Q1181733):
Displayed 27 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Remarks on solutions to a nonconvex quadratic programming test problem (Q540711) (← links)
- Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background (Q686997) (← links)
- What can interval analysis do for global optimization? (Q1186266) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- A priority measure in interval methods for constrained global optimization (Q1321801) (← links)
- The solution of infinitely ill-conditioned weakly-singular problems (Q1585803) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- Application of CASs to iterative solution of nonlinear analysis of shallow conical shell (Q1970197) (← links)
- Iterative analytical solution of nonlinear analysis of shallow spherical shell with computer algebra systems--MapleV (Q1971460) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
- Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations (Q2366970) (← links)
- Investigating a hybrid simulated annealing and local search algorithm for constrained optimization (Q2464206) (← links)
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION (Q3580201) (← links)