Stationarity Results for Generating Set Search for Linearly Constrained Optimization

DOI10.1137/S1052623403433638zbMath1126.90076OpenAlexW2109348499MaRDI QIDQ5426892

Virginia Torczon, Robert Michael Lewis, Tamara G. Kolda

Publication date: 16 November 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623403433638

zbMATH Keywords

stopping criteria constrained optimization linear constraints direct search derivative-free methods generalized pattern search global convergence analysis generating set search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (25)

Optimization with hidden constraints and embedded Monte Carlo computations ⋮ Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ Inexact restoration for derivative-free expensive function minimization and applications ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ 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 ⋮ Optimal execution with non-linear transient market impact ⋮ Constrained derivative-free optimization on thin domains ⋮ A subclass of generating set search with convergence to second-order stationary points ⋮ Globally convergent evolution strategies for constrained optimization ⋮ Direct search based on probabilistic feasible descent for bound and linearly constrained problems ⋮ 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 ⋮ 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 ⋮ Inexact restoration method for nonlinear optimization without derivatives ⋮ An inexact restoration derivative-free filter method for nonlinear programming ⋮ Derivative-free optimization methods for finite minimax problems ⋮ Generating set search using simplex gradients for bound-constrained black-box optimization ⋮ Derivative-free optimization methods ⋮ A Derivative-Free Method for Structured Optimization Problems ⋮ Linear equalities in blackbox optimization ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization ⋮ Avoiding bad steps in Frank-Wolfe variants

Uses Software

SDBOX

This page was built for publication: Stationarity Results for Generating Set Search for Linearly Constrained Optimization