Semi-Infinite Programming: Theory, Methods, and Applications
From MaRDI portal
Publication:3142767
DOI10.1137/1035089zbMath0784.90090DBLPjournals/siamrev/HettichK93OpenAlexW2075887074WikidataQ60306117 ScholiaQ60306117MaRDI QIDQ3142767
No author found.
Publication date: 21 March 1994
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1035089
duality theoryparametric analysisalgorithms for functional approximationfirst- and second-order optimality conditions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Algorithms for approximation of functions (65D15)
Related Items (only showing first 100 items - show all)
Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ On the relationship between the discrete and continuous bounding moment problems and their numerical solutions ⋮ New descent rules for solving the linear semi-infinite programming problem ⋮ Interior-point algorithms for semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ Study of a special nonlinear problem arising in convex semi-infinite programming ⋮ The Lagrange approach to infinite linear programs ⋮ Ambiguity in risk preferences in robust stochastic optimization ⋮ Constraint aggregation principle in convex optimization ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ Process optimization under uncertainty when there is not enough process data at the operation stage ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Semi-infinite programming ⋮ Optimization with a class of multivariate integral stochastic order constraints ⋮ Minimum-time control of a crane with simultaneous traverse and hoisting motions ⋮ A semi-infinite programming model for earliness/tardiness production planning with simulated annealing ⋮ Scenario approximation of robust and chance-constrained programs ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ A robust optimization approach to experimental design for model discrimination of dynamical systems ⋮ A ladder method for linear semi-infinite programming ⋮ A new exact penalty method for semi-infinite programming problems ⋮ A global optimization approach to scalar \(H_2/H_\infty\) control ⋮ Fixed frequency sliding mode-based robust inversion with a full-bridge current DC-link buck-boost ⋮ First order solutions in conic programming ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming ⋮ Robot trajectory planning with semi-infinite programming. ⋮ Nonsmooth semi-infinite programming problem using limiting subdifferentials ⋮ Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity ⋮ Worst case risk measurement: back to the future? ⋮ Generalized semi-infinite programming: a tutorial ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ Kernel methods in machine learning ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ The semismooth approach for semi-infinite programming under the reduction ansatz ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ On the closure of the feasible set in generalized semi-infinite programming ⋮ Uniform LP duality for semidefinite and semi-infinite programming ⋮ Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Optimality conditions for nonlinear infinite programming problems ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ First order optimality conditions for generalized semi-infinite programming problems ⋮ Quasipolyhedral sets in linear semiinfinite inequality systems ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ On the stability of solutions for semi-infinite vector optimization problems ⋮ Generalized semi-infinite programming: On generic local minimizers ⋮ A parallel algorithm for semi-infinite programming ⋮ Augmented lagrangians in semi-infinite programming ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ Duality for nonsmooth semi-infinite programming problems ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ Air pollution control with semi-infinite programming ⋮ Learning the coordinate gradients ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Solving continuous min-max problems by an iterative entropic regularization method. ⋮ On constraint qualifications in nonsmooth optimization. ⋮ Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities ⋮ On numerical optimization theory of infinite kernel learning ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Robust resource allocations in temporal networks ⋮ Design of oversampled double-prototype DFT modulated filter banks via bi-iterative second-order cone program ⋮ Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ A review of infinite matrices and their applications ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ An approach for solving fuzzy implicit variational inequalities with linear membership functions ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ A theory of learning with similarity functions ⋮ Solutions of fuzzy multiobjective programming problems based on the concept of scalarization ⋮ Worst-case estimation for econometric models with unobservable components ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ A filter trust region method for solving semi-infinite programming problems ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions ⋮ Generalized semi-infinite optimization: A first order optimality condition and examples ⋮ Support vector machine classification with indefinite kernels ⋮ On optimality conditions for generalized semi-infinite programming problems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems ⋮ First-order optimality conditions in generalized semi-infinite programming ⋮ Locally Farkas-Minkowski linear inequality systems ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
This page was built for publication: Semi-Infinite Programming: Theory, Methods, and Applications
