A globally convergent primal-dual interior-point filter method for nonlinear programming
From MaRDI portal
Publication:1881567
DOI10.1007/s10107-003-0477-4zbMath1070.90110OpenAlexW1965391256WikidataQ58040625 ScholiaQ58040625MaRDI QIDQ1881567
Stefan Ulbrich, Michael Ulbrich, Luis Nunes Vicente
Publication date: 5 October 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/7764
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Exact optimal experimental designs with constraints, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization, 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, Global convergence of a new nonmonotone filter method for equality constrained optimization, An Affine Scaling Interior Trust-Region Algorithm Combining Backtracking Line Search with Filter Technique for Nonlinear Constrained Optimization, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, A line search filter inexact SQP method for nonlinear equality constrained optimization, Sequential penalty quadratic programming filter methods for nonlinear programming, Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols, A trust-region algorithm combining line search filter technique for nonlinear constrained optimization, A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization, A restoration-free filter SQP algorithm for equality constrained optimization, Learning to steer nonlinear interior-point methods, A new penalty-free-type algorithm based on trust region techniques, A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results, A trust-region framework for constrained optimization using reduced order modeling, An interior point method for nonlinear optimization with a quasi-tangential subproblem, A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, An improved nonmonotone filter trust region method for equality constrained optimization, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, An improved line search filter method for the system of nonlinear equations, A filter algorithm with inexact line search, 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 filter-trust-region method for LC 1 unconstrained optimization and its global convergence, Improving ultimate convergence of an augmented Lagrangian method, Global convergence of a general filter algorithm based on an efficiency condition of the step, A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization, A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues, A trust-region approach with novel filter adaptive radius for system of nonlinear equations, Optimization-based approach to path planning for closed chain robot systems, A local convergence property of primal-dual methods for nonlinear programming, An adaptively regularized sequential quadratic programming method for equality constrained optimization, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, A nonmonotone filter trust region method for nonlinear constrained optimization, An ODE-Based Trust Region Filter Algorithm for Unconstrained Optimization, Extension of primal-dual interior point methods to diff-convex problems on symmetric cones, 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 filter trust-region algorithm for unconstrained optimization with strong global convergence properties, A modified SQP-filter method for nonlinear complementarity problem, A line search filter approach for the system of nonlinear equations, A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem, Nonmonotone filter DQMM method for the system of nonlinear equations, A trust region filter method for general non-linear programming, On second-order optimality conditions for nonlinear programming, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Solving nearly-separable quadratic optimization problems as nonsmooth equations, An SQP-filter method for inequality constrained optimization and its global convergence, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, 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, A feasible filter SQP algorithm with global and local convergence, A penalty-free method with line search for nonlinear equality constrained optimization, 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 line search SQP method without a penalty or a filter, Practical implementation of an interior point nonmonotone line search filter method, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, A penalty-function-free line search SQP method for nonlinear programming, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, ipfilter, Derivative-free optimization and filter methods to solve nonlinear constrained problems, An infeasible interior-point arc-search algorithm for nonlinear constrained optimization, Some results on the filter method for nonlinear complementary problems, Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach, Interior point filter method for semi-infinite programming problems, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, Filter-based stochastic algorithm for global optimization, A filter method for solving nonlinear complementarity problems, An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, A central path interior point method for nonlinear programming and its local convergence
Uses Software
