Pages that link to "Item:Q3830824"
From MaRDI portal
The following pages link to On an outer approximation concept in global optimization (Q3830824):
Displayed 9 items.
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
- Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)