ipfilter

swMATH4778MaRDI QIDQ16941FDOQ16941

Author name not available (Why is that?)

Described by source

• A globally convergent primal-dual interior-point filter method for nonlinear programming

Cited In (73)

• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
• Solving nearly-separable quadratic optimization problems as nonsmooth equations
• A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
• An adaptively regularized sequential quadratic programming method for equality constrained optimization
• Global convergence of a new nonmonotone filter method for equality constrained optimization
• Learning to steer nonlinear interior-point methods
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
• Title not available (Why is that?)
• A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Inner solvers for interior point methods for large scale nonlinear programming
• A new penalty-free-type algorithm based on trust region techniques
• Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols
• A line search filter approach for the system of nonlinear equations
• A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization
• 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 local convergence property of primal-dual methods for nonlinear programming
• A trust-region approach with novel filter adaptive radius for system of nonlinear equations
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs
• 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
• Interior point filter method for semi-infinite programming problems
• An SQP-filter method for inequality constrained optimization and its global convergence
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems
• A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization
• On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
• A filter method for solving nonlinear complementarity problems
• Global convergence of a general filter algorithm based on an efficiency condition of the step
• Sequential penalty quadratic programming filter methods for nonlinear programming
• An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
• A nonmonotone filter trust region method for nonlinear constrained optimization
• Title not available (Why is that?)
• Nonmonotone filter DQMM method for the system of nonlinear equations
• A line search SQP method without a penalty or a filter
• A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues
• Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods
• A nonmonotone line search filter algorithm for the system of nonlinear equations
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
• A trust-region framework for constrained optimization using reduced order modeling
• Optimization-based approach to path planning for closed chain robot systems
• On the superlinear local convergence of a filter-SQP method
• A filter algorithm with inexact line search
• A feasible filter SQP algorithm with global and local convergence
• A modified SQP-filter method for nonlinear complementarity problem
• Some results on the filter method for nonlinear complementary problems
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
• A penalty-free method with line search for nonlinear equality constrained optimization
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• A trust region filter method for general non-linear programming
• An improved nonmonotone filter trust region method for equality constrained optimization
• Improving ultimate convergence of an augmented Lagrangian method
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Optimal Control of Rigid-Link Manipulators by Indirect Methods
• Line search SQP method with a flexible step acceptance procedure
• An ODE-Based Trust Region Filter Algorithm for Unconstrained Optimization
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• An interior point method for nonlinear optimization with a quasi-tangential subproblem
• Filter-based stochastic algorithm for global optimization
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
• A line search filter inexact SQP method for nonlinear equality constrained optimization
• Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
• A restoration-free filter SQP algorithm for equality constrained optimization
• A filter trust-region algorithm for unconstrained optimization with strong global convergence properties
• Exact optimal experimental designs with constraints
• Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach
• A central path interior point method for nonlinear programming and its local convergence
• A filter SQP algorithm without a feasibility restoration phase
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties

This page was built for software: ipfilter