A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
type: Item
instance of: scholarly article
title: A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
zbMATH Open document ID: 1499.90276
author: C. Giuliani
author: Eduardo Camponogara
author: Andrew R. Conn
published in: Computational and Applied Mathematics
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7490224
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: derivative-free trust-region
zbMATH Keywords: exact penalty
zbMATH Keywords: nonlinear programming
describes a project that uses: DFO
describes a project that uses: OrthoMADS
describes a project that uses: DFN
describes a project that uses: NOMAD
describes a project that uses: CUTEst
describes a project that uses: DFL
MaRDI profile type: Publication
full work available at URL: s40314-021-01748-4
OpenAlex ID: W4206927114
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Second-order conditions for an exact penalty function
cites work: Nonlinear programming via an exact penalty function: Global analysis
cites work: Global convergence of trust-region algorithms for convex constrained minimization without derivatives
cites work: Recent progress in unconstrained nonlinear optimization without derivatives
cites work: Geometry of interpolation sets in derivative free optimization
cites work: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
cites work: Introduction to Derivative-Free Optimization
cites work: Derivative-free methods for nonlinear programming with general lower-level constraints
cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
cites work: A derivative-free trust-region algorithm for composite nonsmooth optimization
cites work: A Merit Function Approach for Direct Search
cites work: Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
cites work: Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components
cites work: Algorithm 909
cites work: Direct search methods: Then and now
cites work: A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function
cites work: Q4308910
cites work: Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
cites work: Non-Linear Programming Via Penalty Functions
DOI: 10.1007/S40314-021-01748-4
description: scientific article; zbMATH DE number 7490224