Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions

DOI10.1080/10556788.2020.1746961OpenAlexW3014668226MaRDI QIDQ5038179

No author found.

Publication date: 29 September 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2020.1746961

zbMATH Keywords

numerical resultsquasi-Newtonderivative freeglobal direction search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (1)

A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality

Uses Software

• SLQP-GS
• DFL
• OrthoMADS
• DFN
• GRANSO

Cites Work

• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
• An adaptive competitive penalty method for nonsmooth constrained optimization
• Test examples for nonlinear programming codes
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
• Generalized pattern searches with derivative information
• Linear equalities in blackbox optimization
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• Analysis of Generalized Pattern Searches
• A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION
• On Accelerated Random Search
• Survey of Bundle Methods for Nonsmooth Optimization
• A Progressive Barrier for Derivative-Free Nonlinear Programming
• A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Theory of Positive Linear Dependence
• Frame based methods for unconstrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions