Stationarity Results for Generating Set Search for Linearly Constrained Optimization
From MaRDI portal
Recommendations
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Linearized M-stationarity conditions for general optimization problems
- A subclass of generating set search with convergence to second-order stationary points
- Convergence and stability of line search methods for unconstrained optimization
- Stationary sequences of constrained optimization problems
- scientific article; zbMATH DE number 736944
- On the computation of linearly constrained stationary points
- Convergence of line search methods for unconstrained optimization
- The stationary point set map in general parametric optimization problems
- On the stability of the feasible set in linear optimization
Cited in
(29)- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Avoiding bad steps in Frank-Wolfe variants
- Inexact restoration for derivative-free expensive function minimization and applications
- Linear equalities in blackbox optimization
- Optimization with hidden constraints and embedded Monte Carlo computations
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Constrained derivative-free optimization on thin domains
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- A subclass of generating set search with convergence to second-order stationary points
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Active set identification for linearly constrained minimization without explicit derivatives
- Optimal execution with non-linear transient market impact
- Inexact restoration method for nonlinear optimization without derivatives
- Derivative-free optimization methods for finite minimax problems
- A Derivative-Free Method for Structured Optimization Problems
- An inexact restoration derivative-free filter method for nonlinear programming
- Derivative-free optimization methods
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- Globally convergent evolution strategies for constrained optimization
- Derivative-free augmented Lagrangian for global optimization: cost minimization in a simplified activated sludge system model
- Global convergence of trust-region algorithms for convex constrained minimization without derivatives
This page was built for publication: Stationarity Results for Generating Set Search for Linearly Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426892)
