A Globally Convergent Filter Method for Nonlinear Programming
From MaRDI portal
Publication:4651962
DOI10.1137/S1052623401399320zbMath1079.90129OpenAlexW2094187331MaRDI QIDQ4651962
Elizabeth W. Karas, Márcia Vanti, Clóvis C. Gonzaga
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401399320
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization, Sequential equality-constrained optimization for nonlinear programming, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Local convergence of an inexact-restoration method and numerical experiments, Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems, Optimal non-anticipative scenarios for nonlinear hydro-thermal power systems, Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, Non-monotone inexact restoration method for nonlinear programming, Inexact restoration method for minimization problems arising in electronic structure calculations, A filter secant method with nonmonotone line search for equality constrained optimization, Global convergence of trust-region algorithms for convex constrained minimization without derivatives, IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga, A non-monotone line search multidimensional filter-SQP method for general nonlinear programming, A dwindling filter line search algorithm for nonlinear equality constrained optimization, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization, A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization, A filter-trust-region method for LC 1 unconstrained optimization and its global convergence, Global convergence of a general filter algorithm based on an efficiency condition of the step, Global convergence of slanting filter methods for nonlinear programming, Generalization: One technique of computational and applied mathematical methodology, An exact penalty-Lagrangian approach for large-scale nonlinear programming, On optimization strategies for parameter estimation in models governed by partial differential equations, Inexact restoration method for nonlinear optimization without derivatives, A trust-region approach with novel filter adaptive radius for system of nonlinear equations, Filter-based adaptive Kriging method for black-box optimization problems with expensive objective and constraints, Global convergence of a filter-trust-region algorithm for solving nonsmooth equations, An inexact restoration derivative-free filter method for nonlinear programming, The Sequential Quadratic Programming Method, A bundle-filter method for nonsmooth convex constrained optimization, Sequential quadratic programming with a flexible step acceptance strategy, A nonmonotone filter method for nonlinear optimization, Assessing the reliability of general-purpose inexact restoration methods, On second-order optimality conditions for nonlinear programming, A new line search inexact restoration approach for nonlinear programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A filter-line-search method for unconstrained optimization, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, A filter-trust-region method for simple-bound constrained optimization, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Inexact Restoration approach for minimization with inexact evaluation of the objective function, Local convergence of filter methods for equality constrained non-linear programming, A nonmonotone SQP-filter method for equality constrained optimization, Global convergence of a tri-dimensional filter SQP algorithm based on the line search method, A trust-region SQP method without a penalty or a filter for nonlinear programming, A line search SQP method without a penalty or a filter, A filter algorithm: comparison with NLP solvers, On the Complexity of an Inexact Restoration Method for Constrained Optimization, On sequential optimality conditions for smooth constrained optimization, Gauss-Newton-based BFGS method with filter for unconstrained minimization, A filter inexact-restoration method for nonlinear programming, Derivative-free optimization methods, Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact, A derivative-free trust-region algorithm with copula-based models for probability maximization problems, A dwindling filter line search method for unconstrained optimization, Filter-based stochastic algorithm for global optimization, A flexible inexact-restoration method for constrained optimization
