The approximation algorithm for solving a sort of non-smooth programming
type: Item
instance of: scholarly article
title: The approximation algorithm for solving a sort of non-smooth programming
zbMATH Open document ID: 1144.65040
author: Zaien Hou
author: Fujian Duan
published in: Applied Mathematics and Computation
publication date: 2007-06-06T00:00:00Z
review text: The authors present an approximation algorithm for solving a sort of non-smooth programming, in which the objective function is the Hölder function and the feasible region is contained in a rectangle (viz. hyper-rectangle). To establish the algorithm, the properties of the Hölder function and an approximation of the function by using Bernstein \(\alpha\)-polynomials are studied. The convergence of the algorithm can be guaranteed by the exhaustive of the bisection of the rectangle. The feasibility of the algorithm is validated by solving an example.
reviewed by: Du Ding-Zhu
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5162006
zbMATH Keywords: non-smooth programming
zbMATH Keywords: numerical examples
zbMATH Keywords: Hölder function
zbMATH Keywords: approximation polynomial
zbMATH Keywords: geometrical programming
zbMATH Keywords: branch-and-bound algorithm
describes a project that uses: SNOPT
MaRDI profile type: Publication
full work available at URL: j.amc.2006.06.129
OpenAlex ID: W2131247296
cites work: A programming approach for nonsmooth structural optimization
cites work: Nonsmooth continuous-time optimization problems: Necessary conditions
cites work: A necessary second-order optimality condition in nonsmooth mathematical programming
cites work: A trust region method for minimization of nonsmooth functions with linear constraints
cites work: Applications of interval arithmetic in non-smooth global optimization
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: A unified approach to global convergence of trust region methods for nonsmooth optimization
cites work: New variants of bundle methods
cites work: Lipschitz continuity and the termination of interval methods for global optimization
cites work: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
cites work: The local Hölder function of a continuous function
cites work: Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials
cites work: Introduction to global optimization.
cites work: Solving posynomial geometric programming problems via generalized linear programming
cites work: A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
DOI: 10.1016/J.AMC.2006.06.129
description: scientific article; zbMATH DE number 5162006