Pages that link to "Item:Q1417774"
From MaRDI portal
The following pages link to Semi-infinite programming and applications to minimax problems (Q1417774):
Displaying 22 items.
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models (Q261002) (← links)
- Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
- Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
- Robust portfolio optimization: a conic programming approach (Q453610) (← links)
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- A parallel algorithm for semi-infinite programming (Q956770) (← links)
- Worst-case estimation for econometric models with unobservable components (Q1019967) (← links)
- An algorithm for the global optimization of a class of continuous minimax problems (Q1028590) (← links)
- Robust risk budgeting (Q1621907) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty (Q1731536) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- \(E\)-differentiable minimax programming under \(E\)-convexity (Q2241199) (← links)
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination (Q2256741) (← links)
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization (Q2462558) (← links)
- (Q5055095) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
