Nonlinear programming without a penalty function.
From MaRDI portal
Publication:5957565
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)- Constrained optimization of an idealized Y-shaped baffle for the Fontan surgery at rest and exercise
- Erratum to: ``Nonlinear programming without a penalty function or a filter
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- A feasible filter method for the nearest low-rank correlation matrix problem
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization
- A filter trust-region algorithm for unconstrained optimization with strong global convergence properties
- A projection-filter method for solving nonlinear complementarity problems
- A new trust region filter algorithm
- A modified QP-free feasible method
- Optimization problems with equilibrium constraints and their numerical solution.
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- ODE methods for optimization with equality constraints
- Improved versions of the LEDE algorithm for constrained global optimization
- Trade-off studies in blackbox optimization
- Hierarchically constrained blackbox optimization
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- A filter-variable-metric method for nonsmooth convex constrained optimization
- A kind of nonmonotone filter method for nonlinear complementarity problem
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- A derivative-free filter method for solving nonlinear complementarity problems
- A filter trust region method for solving semi-infinite programming problems
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- A filter-trust-region method for simple-bound constrained optimization
- A nonmonotone filter Barzilai-Borwein method for optimization
- Gauss-Newton-based BFGS method with filter for unconstrained minimization
- Global convergence of slanting filter methods for nonlinear programming
- Hybridizing the electromagnetism-like algorithm with descent search for solving engineering design problems
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- An improved line search filter method for the system of nonlinear equations
- Global convergence of a filter-trust-region algorithm for solving nonsmooth equations
- The Lagrange method and SAO with bounds on the dual variables
- A nonmonotone line search filter algorithm for the system of nonlinear equations
- Filter-based adaptive Kriging method for black-box optimization problems with expensive objective and constraints
- A filter interior-point algorithm with projected Hessian updating for nonlinear optimization
- Local convergence of filter methods for equality constrained non-linear programming
- Effective reformulations of the truss topology design problem
- Global convergence of a robust filter SQP algorithm
- UAV formation flight based on nonlinear model predictive control
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- A modified SQP method with nonmonotone technique and its global convergence
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
- An inexact restoration derivative-free filter method for nonlinear programming
- Steering exact penalty methods for nonlinear programming
- A new filter method for solving nonlinear complementarity problems
- A dwindling filter line search algorithm for nonlinear equality constrained optimization
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- A variable metric method for nonsmooth convex constrained optimization
- Structured regularization for barrier NLP solvers
- A quasi-Newton interior point method for semi-infinite programming
- A filter secant method with nonmonotone line search for equality constrained optimization
- Local convergence of an inexact-restoration method and numerical experiments
- An interior-point trust-funnel algorithm for nonlinear optimization
- A filter algorithm for nonlinear systems of equalities and inequalities
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
- Interior point filter method for semi-infinite programming problems
- On the local convergence of a penalty-function-free SQP method
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- An improved filter method for nonlinear complementarity problem
- Nonmonotone filter DQMM method for the system of nonlinear equations
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- A filter method for nonlinear semidefinite programming with global convergence
- A modified SQP-filter method and its global convergence
- A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
- A trust region filter method for general non-linear programming
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- 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
- On rigorous upper bounds to a global optimum
- Constrained optimization involving expensive function evaluations: A sequential approach
- A filter method for solving nonlinear complementarity problems
- Model reduction in chemical process optimization
- Nonlinear programming without a penalty function or a filter
- A nonmonotone filter trust region method for nonlinear constrained optimization
- A two step filter SQP algorithm for nonlinear constrained optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Minotaur: a mixed-integer nonlinear optimization toolkit
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- An exact penalty function based on the projection matrix
- A secant algorithm with line search filter method for nonlinear optimization
- A dwindling filter trust region algorithm for nonlinear optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- A recipe for finding good solutions to MINLPs
- Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets
- An ODE-Based Trust Region Filter Algorithm for Unconstrained Optimization
- A nonmonotone filter trust region method for the system of nonlinear equations
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A trust-region algorithm combining line search filter technique for nonlinear constrained optimization
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Recent advances in trust region algorithms
- A modified SQP-filter method for nonlinear complementarity problem
- A trust-region framework for constrained optimization using reduced order modeling
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)