Pages that link to "Item:Q4785900"
From MaRDI portal
The following pages link to Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming (Q4785900):
Displaying 50 items.
- A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
- A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- On the global convergence of an SLP-filter algorithm that takes EQP steps (Q1396913) (← links)
- A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. (Q1398662) (← links)
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization (Q1633865) (← links)
- Line search filter inexact secant methods for nonlinear equality constrained optimization (Q1663551) (← links)
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
- A penalty-free method with line search for nonlinear equality constrained optimization (Q1792357) (← links)
- A nonlinear interval portfolio selection model and its application in banks (Q1794302) (← links)
- A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds (Q1876585) (← links)
- On the superlinear local convergence of a filter-SQP method (Q1890309) (← links)
- An improved nonmonotone filter trust region method for equality constrained optimization (Q1949431) (← links)
- An improved line search filter method for the system of nonlinear equations (Q1952809) (← links)
- A filter algorithm with inexact line search (Q1954692) (← links)
- A nonmonotone line search filter algorithm for the system of nonlinear equations (Q1955426) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies (Q2115032) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- Optimality properties of an augmented Lagrangian method on infeasible problems (Q2352419) (← links)
- Exact optimal experimental designs with constraints (Q2361462) (← links)
- A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization (Q2364355) (← links)
- Global convergence of a new nonmonotone filter method for equality constrained optimization (Q2375740) (← links)
- A new trust region filter algorithm (Q2378945) (← links)
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
- A line search filter inexact SQP method for nonlinear equality constrained optimization (Q2391911) (← links)
- A non-monotone line search multidimensional filter-SQP method for general nonlinear programming (Q2430756) (← links)
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization (Q2439887) (← links)
- Global convergence of a general filter algorithm based on an efficiency condition of the step (Q2453360) (← links)
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
- A line search filter approach for the system of nonlinear equations (Q2483084) (← links)
- A trust region filter method for general non-linear programming (Q2489398) (← links)
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization (Q2489456) (← links)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
- A feasible filter SQP algorithm with global and local convergence (Q2511102) (← links)
- A trust-region SQP method without a penalty or a filter for nonlinear programming (Q2515095) (← links)
- A line search SQP method without a penalty or a filter (Q2516801) (← links)
- A filter method for solving nonlinear complementarity problems (Q2570745) (← links)
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems (Q2655405) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase (Q2805993) (← links)
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs (Q2806813) (← links)
- An inexact ℓ<sub>1</sub>penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity (Q2867419) (← links)
- A trust-region algorithm combining line search filter technique for nonlinear constrained optimization (Q2935397) (← links)
- The quasiparticle lifetime in a doped graphene sheet (Q2962385) (← links)
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming (Q2970395) (← links)
