Pages that link to "Item:Q1817320"
From MaRDI portal
The following pages link to Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320):
Displaying 12 items.
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- Bisecton by global optimization revisited (Q965055) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
- (Q3718483) (← links)
- THE PROBLEM OF CUTTING SUBSPACES (Q4301232) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
