Nonlinear programming without a penalty function.
From MaRDI portal
Publication:5957565
DOI10.1007/S101070100244zbMATH Open1049.90088OpenAlexW2048799772MaRDI QIDQ5957565FDOQ5957565
Authors: Roger Fletcher, Sven Leyffer 
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
Recommendations
- Nonlinear programming without a penalty function or a filter
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- A two step filter SQP algorithm for nonlinear constrained optimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Sequential penalty quadratic programming filter methods for nonlinear programming
Cited In (only showing first 100 items - show all)
- A filter-trust-region method for LC 1 unconstrained optimization and its global convergence
- The Sequential Quadratic Programming Method
- Analysis of multi-objective Kriging-based methods for constrained global optimization
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A new penalty-free-type algorithm based on trust region techniques
- Model reduction in chemical process optimization
- A line search filter approach for the system of nonlinear equations
- A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming
- A trust region SQP-filter method for nonlinear second-order cone programming
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- A trust-region approach with novel filter adaptive radius for system of nonlinear equations
- Nonlinear programming without a penalty function or a filter
- An exact penalty function based on the projection matrix
- A dwindling filter trust region algorithm for nonlinear optimization
- Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets
- Constrained optimization using multiple objective programming
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Three modeling paradigms in mathematical programming
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. II: Application
- A penalty-function-free line search SQP method for nonlinear programming
- A bundle-filter method for nonsmooth convex constrained optimization
- Global and local convergence of a filter line search method for nonlinear programming
- A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization
- A dwindling filter line search method for unconstrained optimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- An SQP-filter method for inequality constrained optimization and its global convergence
- Nonlinear optimization with GAMS /LGO
- A tri-dimensional filter SQP algorithm for variational inequality problems
- A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization
- A line search exact penalty method using steering rules
- A filter method for solving nonlinear complementarity problems
- A nonmonotone filter trust region method for the system of nonlinear equations
- Sequential penalty quadratic programming filter methods for nonlinear programming
- Global convergence of a nonmonotone filter method for equality constrained optimization
- A globally and superlinearly convergent modified SQP-filter method
- A nonmonotone filter trust region method for nonlinear constrained optimization
- On filter-successive linearization methods for nonlinear semidefinite programming
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
- Stochastic filter methods for generally constrained global optimization
- A secant algorithm with line search filter method for nonlinear optimization
- A nonmonotone filter method for nonlinear optimization
- A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- A smoothing conic trust region filter method for the nonlinear complementarity problem
- A modified SLP algorithm and its global convergence
- A recipe for finding good solutions to MINLPs
- A trust-region framework for constrained optimization using reduced order modeling
- Optimization-based approach to path planning for closed chain robot systems
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- A filter-line-search method for unconstrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- A modified SQP-filter method for nonlinear complementarity problem
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- Optimization of algorithms with OPAL
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Globalization strategies for mesh adaptive direct search
- A computational framework for derivative-free optimization of cardiovascular geometries
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A non-monotone line search multidimensional filter-SQP method for general nonlinear programming
- A trust region filter method for general non-linear programming
- A new SQP-filter method for solving nonlinear programming problems.
- A two step filter SQP algorithm for nonlinear constrained optimization
- An ODE-Based Trust Region Filter Algorithm for Unconstrained Optimization
- A nonmonotone filter SQP method: local convergence and numerical results
- A local search method for optimization problem with d.c. inequality constraints
- DC programming and DCA for general DC programs
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Recent advances in trust region algorithms
- A restoration-free filter SQP algorithm for equality constrained optimization
- A nonmonotone SQP-filter method for equality constrained optimization
- Constrained optimization involving expensive function evaluations: A sequential approach
- An interior-point piecewise linear penalty method for nonlinear programming
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- On rigorous upper bounds to a global optimum
- A Newton method for solving continuous multiple material minimum compliance problems
- Sequential approximate optimization using dual subproblems based on incomplete series expansions
- Constrained particle swarm optimization using a bi-objective formulation
- A trust-region algorithm combining line search filter technique for nonlinear constrained optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Global convergence of slanting filter methods for nonlinear programming
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- On the local convergence of a penalty-function-free SQP method
- ODE methods for optimization with equality constraints
- A new trust region filter algorithm
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- A kind of nonmonotone filter method for nonlinear complementarity problem
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- A filter secant method with nonmonotone line search for equality constrained optimization
Uses Software
This page was built for publication: Nonlinear programming without a penalty function.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957565)
