The approximation algorithm for solving a sort of non-smooth programming

DOI10.1016/j.amc.2006.06.129zbMath1144.65040OpenAlexW2131247296MaRDI QIDQ884618

Zai-En Hou, Fu-Jian Duan

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.129

zbMATH Keywords

branch-and-bound algorithmnumerical examplesHölder functiongeometrical programmingapproximation polynomialnon-smooth programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items

Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization

Uses Software

• SNOPT

Cites Work

• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• A trust region method for minimization of nonsmooth functions with linear constraints
• Applications of interval arithmetic in non-smooth global optimization
• The local Hölder function of a continuous function
• A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
• Approximation of multivariate function by using new multivariate Bernstein \(\alpha\)-polynomials
• A unified approach to global convergence of trust region methods for nonsmooth optimization
• New variants of bundle methods
• A programming approach for nonsmooth structural optimization
• A necessary second-order optimality condition in nonsmooth mathematical programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Introduction to global optimization.
• Nonsmooth continuous-time optimization problems: Necessary conditions
• Lipschitz continuity and the termination of interval methods for global optimization
• Solving posynomial geometric programming problems via generalized linear programming