Objective-derivative-free methods for constrained optimization

From MaRDI portal
Publication:1600094

DOI10.1007/s101070100266zbMath1024.90062OpenAlexW2019362739MaRDI QIDQ1600094

Paul Tseng, Marco Sciandrone, Stefano Lucidi

Publication date: 12 June 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100266



Related Items

A derivative-free comirror algorithm for convex optimization, Unit commitment in oligopolistic markets by nonlinear mixed variable programming, Derivative-free methods for bound constrained mixed-integer optimization, Globally convergent evolution strategies for constrained optimization, Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions, Inexact restoration method for nonlinear optimization without derivatives, A derivative-free algorithm for systems of nonlinear inequalities, A convergent decomposition algorithm for support vector machines, A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization, Generating set search using simplex gradients for bound-constrained black-box optimization, Solving constrained optimization problems using a novel genetic algorithm, A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints, Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints, Derivative-free optimization methods, A Derivative-Free Method for Structured Optimization Problems, Derivative free methodologies for circuit worst case analysis, Derivative-free methods for mixed-integer constrained optimization problems