• Home
  • Search
  • A Progressive Barrier for Derivative-Free Nonlinear Programming
  • Cite Icon211
  • https://doi.org/10.1137/070692662Copy DOI Icon

A Progressive Barrier for Derivative-Free Nonlinear Programming

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We propose a new constraint-handling approach for general constraints that is applicable to a widely used class of constrained derivative-free optimization methods. As in many methods that allow infeasible iterates, constraint violations are aggregated into a single constraint violation function. As in filter methods, a threshold, or barrier, is imposed on the constraint violation function, and any trial point whose constraint violation function value exceeds this threshold is discarded from consideration. In the new algorithm, unlike the filter method, the amount of constraint violation subject to the barrier is progressively decreased adaptively as the iteration evolves. We test this progressive barrier (PB) approach versus the extreme barrier (EB) with the generalized pattern search (Gps) and the lower triangular mesh adaptive direct search (LTMads) methods for nonlinear derivative-free optimization. Tests are also conducted using the Gps-filter, which uses a version of the Fletcher–Leyffer filter approach. We know that Gps cannot be shown to yield kkt points with this strategy or the filter, but we use the Clarke nonsmooth calculus to prove Clarke stationarity of the sequences of feasible and infeasible trial points for LTMads-PB. Numerical experiments are conducted on three academic test problems with up to 50 variables and on a chemical engineering problem. The new LTMads-PB method generally outperforms our LTMads-EB in the case where no feasible initial points are known, and it does as well when feasible points are known. which leads us to recommend LTMads-PB. Thus the LTMads-PB is a useful practical extension of our earlier LTMads-EB algorithm, particularly in the common case for real problems where no feasible point is known. The same conclusions hold for Gps-PB versus Gps-EB.

Similar Papers
  • Research Article
  • Citations4

Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization

  • Jul 16, 2014
  • Computational Optimization and Applications
  • Chungen Shen +3
  • Research Article
  • Citations10

Data-Driven Optimization of Piezoelectric Energy Harvesters via Pattern Search Algorithm

  • May 15, 2021
  • Micromachines
  • Yang Huang +3
  • Research Article
  • Citations17

A derivative-free filter method for solving nonlinear complementarity problems

  • Feb 04, 2004
  • Applied Mathematics and Computation
  • Pu-Yan Nie +1
  • Research Article
  • Citations37

A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems

  • Jan 01, 1998
  • Journal of Combinatorial Optimization
  • Le Thi Hoai An +2
  • Research Article
  • Citations7

A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization

  • Sep 21, 2017
  • Applied Mathematics and Computation
  • Jianling Li +1
  • Conference Article
  • Citations2

Mixed Discrete and Continuous Variable Optimization Based on Constraint Aggregation and Relative Sensitivity

  • Aug 04, 2013
  • Zhansi Jiang +2
  • Research Article
  • Citations2

A gradient-improved sampling plan for surrogate-based aerodynamic shape optimization using discontinuous Galerkin methods

  • Aug 01, 2024
  • Physics of Fluids
  • Yiwei Feng +4
  • Book Chapter
  • Citations3

Design of PID controllers using semi-infinite programming

  • Jan 01, 2022
  • Computer Aided Chemical Engineering
  • Evren M Turan +2
  • Book Chapter
  • Citations26

Genetic Algorithms Versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints

  • Jan 01, 1994
  • A C Thornton
  • Research Article
  • Citations560

Solving Airline Crew Scheduling Problems by Branch-and-Cut

  • Jun 01, 1993
  • Management Science
  • Karla L Hoffman +1
  • Research Article
  • Citations30

A trust region filter method for general non-linear programming

  • May 11, 2005
  • Applied Mathematics and Computation
  • Pu-Yan Nie +1
  • Research Article
  • Citations112

An evolutionary algorithm with directed weights for constrained multi-objective optimization

  • Jul 13, 2017
  • Applied Soft Computing
  • Chaoda Peng +2
  • Conference Article
  • Citations1

Artificial neural network controller for multi-link structures

  • Jan 05, 1995
  • D.L Styer +1
  • Research Article
  • Citations185

Tabu Search directed by direct search methods for nonlinear global optimization

  • Apr 01, 2006
  • European Journal of Operational Research
  • Abdel-Rahman Hedar +1
  • Book Chapter

Surrogate Modeling for Superstructure Optimization with Generalized Disjunctive Programming

  • Jan 01, 2022
  • Computer Aided Chemical Engineering
  • H.A Pedrozo +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.