Pages that link to "Item:Q4995065"
From MaRDI portal
The following pages link to Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065):
Displaying 12 items.
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- A decomposition heuristic for mixed-integer supply chain problems (Q2183192) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches (Q6088759) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Extended mean-conditional value-at-risk portfolio optimization with PADM and conditional scenario reduction technique (Q6177016) (← links)
- A penalty decomposition algorithm for the extended mean-variance-CVaR portfolio optimization problem (Q6560769) (← links)
- Computational linear bilevel optimization (Q6606514) (← links)
- A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results (Q6606535) (← links)
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems (Q6632222) (← links)
