Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
type: Item
instance of: scholarly article
title: Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
DOI: 10.1080/10556788.2020.1746961
publication date: 2022-09-29T00:00:00Z
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7594842
zbMATH Keywords: derivative free
zbMATH Keywords: global direction search
zbMATH Keywords: quasi-Newton
zbMATH Keywords: numerical results
describes a project that uses: DFN
describes a project that uses: OrthoMADS
describes a project that uses: GRANSO
describes a project that uses: SLQP-GS
describes a project that uses: DFL
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/10556788.2020.1746961
OpenAlex ID: W3014668226
cites work: Generalized pattern searches with derivative information
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: On Accelerated Random Search
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Linear equalities in blackbox optimization
cites work: Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
cites work: Q3996569
cites work: Frame based methods for unconstrained optimization
cites work: On the convergence of grid-based methods for unconstrained optimization
cites work: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
cites work: A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
cites work: Theory of Positive Linear Dependence
cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
cites work: Q4226179
cites work: Test examples for nonlinear programming codes
cites work: Q4312906
cites work: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
cites work: An adaptive competitive penalty method for nonsmooth constrained optimization
cites work: Survey of Bundle Methods for Nonsmooth Optimization
cites work: A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION
cites work: Q3397673
cites work: Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
cites work: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
cites work: Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
Recommended article: A direct search method for smooth and nonsmooth unconstrained optimization
Recommended article: Q5399870
Recommended article: An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
Recommended article: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
Recommended article: Q4643052
Recommended article: A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION
Recommended article: A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
Recommended article: Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization
Recommended article: On smoothing exact penalty functions for nonlinear constrained optimization problems
Recommended article: A feasible directions method for nonsmooth convex optimization
published in: Optimization Methods \& Software
description: scientific article; zbMATH DE number 7594842