Nonlinear programming without a penalty function.
From MaRDI portal
Publication:5957565
DOI10.1007/s101070100244zbMath1049.90088MaRDI QIDQ5957565
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100244
Related Items
A quasi-Newton interior point method for semi-infinite programming, Solving mathematical programs with complementarity constraints as nonlinear programs, Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming, Global and local convergence of a filter line search method for nonlinear programming, Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems, A filter-trust-region method for simple-bound constrained optimization, Practical implementation of an interior point nonmonotone line search filter method, A filter algorithm: comparison with NLP solvers, Interior point methods for large-scale nonlinear programming, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming., Optimization problems with equilibrium constraints and their numerical solution., Local convergence of an inexact-restoration method and numerical experiments, Sequential penalty quadratic programming filter methods for nonlinear programming, A variable metric method for nonsmooth convex constrained optimization, Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets, A new filter method for solving nonlinear complementarity problems, Constrained optimization using multiple objective programming, Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties, Global convergence of slanting filter methods for nonlinear programming, A globally and superlinearly convergent modified SQP-filter method, Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search, A quadratically approximate framework for constrained optimization, global and local convergence, A nonmonotone filter trust region method for nonlinear constrained optimization, A bundle-filter method for nonsmooth convex constrained optimization, Global convergence of a tri-dimensional filter SQP algorithm based on the line search method, A filter-variable-metric method for nonsmooth convex constrained optimization, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, A derivative-free filter method for solving nonlinear complementarity problems, Constrained optimization involving expensive function evaluations: A sequential approach, Dealing with singularities in nonlinear unconstrained optimization, A new trust region filter algorithm, A filter method for solving nonlinear complementarity problems based on derivative-free line search, Derivative-free filter simulated annealing method for constrained continuous global optimization, Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria, Nonlinear optimization with GAMS /LGO, A line search filter approach for the system of nonlinear equations, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, A trust region filter method for general non-linear programming, A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm, A filter method for solving nonlinear complementarity problems, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization, A filter-trust-region method for LC 1 unconstrained optimization and its global convergence, Steering exact penalty methods for nonlinear programming, Filter-sequence of quadratic programming method with nonlinear complementarity problem function
Uses Software
