scientific article
From MaRDI portal
Publication:3939127
zbMath0481.65033MaRDI QIDQ3939127
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stabilitynumerical exampleslocal minimasimplex methodNewton methodsmethod of steepest descentprimal and dual optimality conditionsRemez methodlocal reduction on finite problems
Applications of mathematical programming (90C90) Numerical computation of solutions to systems of equations (65H10) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Approximation by rational functions (41A20) Algorithms for approximation of functions (65D15) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Related Items (86)
Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ On the rational approximation of \(e^{-x}\) on [0,\(\infty)\) ⋮ Strong unicity in nonlinear approximation and free knot splines ⋮ Metric regularity of the feasible set mapping in semi-infinite optimization ⋮ An efficient algorithm for solving semi-infinite inequality problems with box constraints ⋮ Semi-infinite optimization: Structure and stability of the feasible set ⋮ Strongly unique spline approximations with free knots ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ Optimal value function in semi-infinite programming ⋮ An interior semi-infinite programming method ⋮ Discrete approximations of minimization problems. II. Applications ⋮ On regularity and stability in semi-infinite optimization ⋮ Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions ⋮ An implementation of a discretization method for semi-infinite programming ⋮ Unicity in linear optimization ⋮ On regular minimax optimization ⋮ Critical sets in parametric optimization ⋮ Connections between generalized, inexact and semi-infinite linear programming ⋮ Semi-infinite programming ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ An interior-point method for semi-infinite programming problems ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ On equivalent stability properties in semi-infinite optimization ⋮ The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets ⋮ SIP: critical value functions have finite modulus of non-convexity ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ On saddle points in nonconvex semi-infinite programming ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Dimension and finite reduction in linear semi-infinite programming ⋮ An optimality test for semi-infinite linear programming ⋮ Directional derivatives for the value-function in semi-infinite programming ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ Reduction and Discrete Approximation in Linear Semi-Infinite Programming ⋮ Strong unicity and alternation for linear optimization ⋮ On stable uniqueness in linear semi-infinite optimization ⋮ Second order optimality conditions for generalized semi-infinite programming problems ⋮ Generalized semi-infinite programming: a tutorial ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ Semi-infinite linear optimization on noncompact spaces and its application to approximation theory ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ A cutting-plane method for quadratic semi infinite programming problems ⋮ On the linear convergence rates of exchange and continuous methods for total variation minimization ⋮ Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ Kuhn-Tucker curves for one-parametric semi-infinite programming ⋮ Generalized semi-infinite programming: On generic local minimizers ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ How to solve a semi-infinite optimization problem ⋮ A semi-infinite programming method for approximating load duration curves by polynomials ⋮ On implicit active constraints in linear semi-infinite programs with unbounded coefficients ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ Global unicity in semi-infinite optimization ⋮ ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS* ⋮ On constraint qualifications in nonsmooth optimization. ⋮ On numerical optimization theory of infinite kernel learning ⋮ On semi-infinite optimization and chebyshev approximation with contraints ⋮ On parametric nonlinear programming ⋮ Optimization of gene-environment networks in the presence of errors and uncertainty with Chebychev approximation ⋮ Computational aspects of general minimax optimization ⋮ Generalized semi-infinite programming: Theory and methods ⋮ On discretization errors in nonlinear approximation problems ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ Generalized semi-infinite optimization: A first order optimality condition and examples ⋮ A refinement of an optimality criterion and its application to parametric programming ⋮ On Haar's dual problem ⋮ Path-following proximal approach for solving ill-posed convex semi-infinite programming problems ⋮ Optimality conditions in smooth nonlinear programming ⋮ Robust static hedging of barrier options in stochastic volatility models ⋮ On optimality conditions for generalized semi-infinite programming problems ⋮ On feasible sets defined through Chebyshev approximation ⋮ Unnamed Item ⋮ An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions. ⋮ Accelerated polynomial approximation of finite order entire functions by growth reduction ⋮ Unnamed Item ⋮ Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions ⋮ On level sets of marginal functions ⋮ An algorithm for segment approximation ⋮ Spline smoothing under constraints on derivatives ⋮ Unicity in one-sided \(L_ 1\)-approximation and quadrature formulae ⋮ An extension of strong uniqueness to rational approximation ⋮ Discretization methods for the solution of semi-infinite programming problems ⋮ Problem-based optimal scenario generation and reduction in stochastic programming ⋮ An approximation of feasible sets in semi-infinite optimization.
This page was built for publication:
