A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
From MaRDI portal
Publication:2115032
DOI10.1007/s40314-021-01748-4zbMath1499.90276OpenAlexW4206927114MaRDI QIDQ2115032
C. Giuliani, Eduardo Camponogara, Andrew R. Conn
Publication date: 15 March 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01748-4
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Global convergence of trust-region algorithms for convex constrained minimization without derivatives
- Recent progress in unconstrained nonlinear optimization without derivatives
- Direct search methods: Then and now
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Geometry of interpolation sets in derivative free optimization
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Algorithm 909
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
- Introduction to Derivative-Free Optimization
- Second-order conditions for an exact penalty function
- Nonlinear programming via an exact penalty function: Global analysis
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- A Merit Function Approach for Direct Search
- Non-Linear Programming Via Penalty Functions
