Pages that link to "Item:Q3622011"

The following pages link to Semi-infinite programming, duality, discretization and optimality conditions† (Q3622011):

Displaying 47 items.

• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
• Nonsmooth semi-infinite programming problem using limiting subdifferentials (Q454252) (← links)
• Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
• Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem (Q494875) (← links)
• Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity (Q498079) (← links)
• Strong duality and sensitivity analysis in semi-infinite linear programming (Q507336) (← links)
• First and second order optimality conditions for vector optimization problems on metric spaces (Q643752) (← links)
• Stability and augmented Lagrangian duality in nonconvex semi-infinite programming (Q644188) (← links)
• Duality for nonsmooth semi-infinite programming problems (Q691458) (← links)
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
• On necessary optimality conditions for nonsmooth vector optimization problems with mixed constraints in infinite dimensions (Q722073) (← links)
• Distributionally robust inference for extreme value-at-risk (Q784395) (← links)
• An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
• On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity (Q1723855) (← links)
• Second-order sequence-based necessary optimality conditions in constrained nonsmooth vector optimization and applications (Q1746020) (← links)
• Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
• Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization (Q1935288) (← links)
• Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
• On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
• Optimality analysis of a class of semi-infinite programming problems (Q2194121) (← links)
• On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
• An improved bootstrap test for restricted stochastic dominance (Q2236873) (← links)
• Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
• How to solve a semi-infinite optimization problem (Q2253347) (← links)
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
• Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity (Q2341603) (← links)
• Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
• First and second order optimality conditions in vector optimization problems with nontransitive preference relation (Q2631297) (← links)
• Second order analysis for robust inclusion systems and applications (Q2679239) (← links)
• Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints (Q3388451) (← links)
• No-arbitrage bounds for the forward smile given marginals (Q4555138) (← links)
• On an eigenvalue for the Laplace operator in a disk with Dirichlet boundary condition on a small part of the boundary in a critical case (Q4691864) (← links)
• A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints (Q4995612) (← links)
• Distributionally robust portfolio optimization with linearized STARR performance measure (Q5068074) (← links)
• Theory and Algorithms for Shapelet-Based Multiple-Instance Learning (Q5131159) (← links)
• (Q5152653) (← links)
• (Q5154504) (← links)
• Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions (Q5243389) (← links)
• Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming (Q5245019) (← links)
• LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)
• Slater Condition for Tangent Derivatives (Q5870376) (← links)
• Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications (Q6107989) (← links)
• Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
• Variational analysis based on proximal subdifferential on smooth Banach spaces (Q6155103) (← links)
• An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)