The following pages link to (Q4357206):
Displaying 50 items.
- Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities (Q265127) (← links)
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming (Q301728) (← links)
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Robustness in nonsmooth nonlinear multi-objective programming (Q319993) (← links)
- Optimality conditions for strict minimizers of higher-order in semi-infinite multi-objective optimization (Q338876) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
- Normal subdifferentials of efficient point multifunctions in parametric vector optimization (Q360483) (← links)
- A ladder method for linear semi-infinite programming (Q380573) (← links)
- Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization (Q386471) (← links)
- A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Subdifferential of optimal value functions in nonlinear infinite programming (Q434364) (← links)
- On stable uniqueness in linear semi-infinite optimization (Q454262) (← links)
- On metric regularity and the boundary of the feasible set in linear optimization (Q456979) (← links)
- Isolated and proper efficiencies in semi-infinite vector optimization problems (Q467444) (← links)
- A new computational approach for solving optimal control of linear PDEs problem (Q477501) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- Robust duality in parametric convex optimization (Q491220) (← links)
- New glimpses on convex infinite optimization duality (Q496382) (← links)
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data (Q497436) (← links)
- Quantitative stability of full random two-stage stochastic programs with recourse (Q497451) (← links)
- Critical objective size and calmness modulus in linear programming (Q505622) (← links)
- Strong duality and sensitivity analysis in semi-infinite linear programming (Q507336) (← links)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- On implicit active constraints in linear semi-infinite programs with unbounded coefficients (Q535337) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization (Q618891) (← links)
- Point-based neighborhoods for sharp calmness constants in linear programming (Q683298) (← links)
- On the stability of solutions for semi-infinite vector optimization problems (Q683719) (← links)
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
- Generalized Clarke epiderivatives of parametric vector optimization problems (Q711695) (← links)
- Subsmooth semi-infinite and infinite optimization problems (Q715070) (← links)
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
- Calmness of the feasible set mapping for linear inequality systems (Q742194) (← links)
- Lipschitz lower semicontinuity moduli for linear inequality systems (Q776920) (← links)
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
- Boundary of maximal monotone operators values (Q781556) (← links)
- Distributionally robust inference for extreme value-at-risk (Q784395) (← links)
- Separating the solution sets of analytical and polynomial systems (Q819953) (← links)
- Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems (Q849317) (← links)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329) (← links)
- Generalized moment theory and Bayesian robustness analysis for hierarchical mixture models (Q870499) (← links)
- On generalized semi-infinite programming. (With comments and rejoinder). (Q874881) (← links)
- First order solutions in conic programming (Q890175) (← links)
