Pages that link to "Item:Q3142767"

The following pages link to Semi-Infinite Programming: Theory, Methods, and Applications (Q3142767):

Displaying 50 items.

• Pareto solutions in multicriteria optimization under uncertainty (Q2333011) (← links)
• A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
• Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity (Q2341603) (← links)
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
• Existence of augmented Lagrange multipliers for semi-infinite programming problems (Q2363568) (← links)
• Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
• A homotopy interior point method for semi-infinite programming problems (Q2385505) (← links)
• Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
• A fuzzy semi-infinite optimization problem (Q2405739) (← links)
• How to solve a design centering problem (Q2408900) (← links)
• Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
• Quadratic two-stage stochastic optimization with coherent measures of risk (Q2413101) (← links)
• A class of two-stage distributionally robust games (Q2423291) (← links)
• Necessary optimality conditions for a nonsmooth semi-infinite programming problem (Q2423798) (← links)
• Stability in unified semi-infinite vector optimization (Q2423812) (← links)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
• Copositive programming via semi-infinite optimization (Q2435031) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
• Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
• Second-order nonsmooth optimization for \(H_{\infty}\) synthesis (Q2454715) (← links)
• A constrained optimum experimental design problem for model discrimination with a continuously varying factor (Q2455424) (← links)
• Necessary conditions and duality for inexact nonlinear semi-infinite programming problems (Q2466781) (← links)
• Algorithms for infinite quadratic programming in \(L_p\) spaces (Q2479348) (← links)
• Static arbitrage bounds on basket option prices (Q2492673) (← links)
• Nonsmooth optimization for multidisk \(H_\infty\) synthesis (Q2512054) (← links)
• On Haar's dual problem (Q2564337) (← links)
• Path-following proximal approach for solving ill-posed convex semi-infinite programming problems (Q2565003) (← links)
• A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model (Q2655624) (← links)
• On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity (Q2656887) (← links)
• Generalized semi-infinite programming: numerical aspects (Q2720274) (← links)
• Strong duality for inexact linear programming (Q2720275) (← links)
• A Semi-Infinite Programming Model In Data Envelopment Analysis (Q2747937) (← links)
• On the 1962-1972 decade of semi-infinite programming: a subjective view. (Q2776644) (← links)
• Proximal interior point method for convex semi-infinite programming (Q2778680) (← links)
• Characterizing optimal wages in principal-agent problems without using the first-order approach (Q2790890) (← links)
• Some applications of the Semi-Infinite Simplex Algorithm (Q2808315) (← links)
• An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
• An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← links)
• A smoothing approach for the optimal parameter selection problem with continuous inequality constraint (Q2867401) (← links)
• A fast algorithm for the optimal design of high accuracy windows in signal processing (Q2867415) (← links)
• A cover partitioning method for bound constrained global optimization (Q2905347) (← links)
• On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity (Q2912153) (← links)
• Multiple kernel learning with gaussianity measures (Q2919423) (← links)
• An adaptive numerical method for semi-infinite elliptic control problems based on error estimates (Q2943832) (← links)
• On Proper Efficiency in Multiobjective Semi-infinite Optimization (Q2948782) (← links)
• Optimization with Multivariate Stochastic Dominance Constraints (Q2954390) (← links)
• Genericity Results in Linear Conic Programming—A Tour d’Horizon (Q2976141) (← links)
• Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming (Q3008571) (← links)
• Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems (Q3055165) (← links)