A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
From MaRDI portal
Recommendations
- A derivative-free method for linearly constrained nonsmooth optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A derivative-free algorithm for linearly constrained optimization problems
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- A matrix-free line-search algorithm for nonconvex optimization
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- Derivative-free algorithm for nonlinear optimization problems with partial-bounded constraints
- scientific article; zbMATH DE number 3916028
- A nonmonotone line search method and its convergence for unconstrained optimization
Cited in
(48)- A derivative-free approach to constrained multiobjective nonsmooth optimization
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- Essentials of numerical nonsmooth optimization
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- Binary, unrelaxable and hidden constraints in blackbox optimization
- Derivative free methodologies for circuit worst case analysis
- Escaping local minima with local derivative-free methods: a numerical investigation
- Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- A new sequential optimality condition for constrained nonsmooth optimization
- A DIRECT-type approach for derivative-free constrained global optimization
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- Essentials of numerical nonsmooth optimization
- Filter-based DIRECT method for constrained global optimization
- The limitation of neural nets for approximation and optimization
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- A derivative-free optimization approach for the autotuning of a forex trading strategy
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
- An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
- DFN
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Combining gradient information and primitive directions for high-performance bound-constrained mixed-integer optimization
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- A derivative-free approach to mixed integer constrained multiobjective nonsmooth black-box optimization
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization
- Worst case complexity bounds for linesearch-type derivative-free algorithms
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- A derivative-free nonmonotone line search and its application to the spectral residual method
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- Retraction-based direct search methods for derivative free Riemannian optimization
- Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback
- A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
- MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization
- Black-Box Optimization: Methods and Applications
- A geometric integration approach to nonsmooth, nonconvex optimisation
- Derivative-free optimization methods
This page was built for publication: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934466)
