Pages that link to "Item:Q3142767"

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

Displaying 50 items.

• A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models (Q261002) (← links)
• 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)
• Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions (Q301732) (← links)
• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
• Ambiguity in risk preferences in robust stochastic optimization (Q323319) (← links)
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
• Optimization with a class of multivariate integral stochastic order constraints (Q363558) (← links)
• Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
• On the convergence of a smoothed penalty algorithm for semi-infinite programming (Q376724) (← links)
• A robust optimization approach to experimental design for model discrimination of dynamical systems (Q378083) (← links)
• A ladder method for linear semi-infinite programming (Q380573) (← links)
• A new exact penalty method for semi-infinite programming problems (Q390477) (← links)
• A global optimization approach to scalar \(H_2/H_\infty\) control (Q397654) (← links)
• Fixed frequency sliding mode-based robust inversion with a full-bridge current DC-link buck-boost (Q398337) (← 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)
• Optimality conditions for nonlinear infinite programming problems (Q497442) (← 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)
• Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities (Q550103) (← links)
• Minimum-time control of a crane with simultaneous traverse and hoisting motions (Q597153) (← links)
• A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
• Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
• Worst case risk measurement: back to the future? (Q654815) (← links)
• A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
• Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
• Quasipolyhedral sets in linear semiinfinite inequality systems (Q677806) (← links)
• On the stability of solutions for semi-infinite vector optimization problems (Q683719) (← links)
• Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
• Duality for nonsmooth semi-infinite programming problems (Q691458) (← links)
• A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
• Learning the coordinate gradients (Q695644) (← links)
• Solving continuous min-max problems by an iterative entropic regularization method. (Q703165) (← links)
• On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
• On numerical optimization theory of infinite kernel learning (Q708898) (← links)
• Subsmooth semi-infinite and infinite optimization problems (Q715070) (← links)
• Robust resource allocations in temporal networks (Q715076) (← links)
• Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
• An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
• Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
• Study of a special nonlinear problem arising in convex semi-infinite programming (Q844519) (← links)
• Process optimization under uncertainty when there is not enough process data at the operation stage (Q862499) (← links)