Pages that link to "Item:Q5317547"

The following pages link to Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence (Q5317547):

Displaying 50 items.

• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
• An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← 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)
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← 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)
• An improved finite element meshing strategy for dynamic optimization problems (Q1992793) (← links)
• A basis reduction method using proper orthogonal decomposition for shakedown analysis of kinematic hardening material (Q1999549) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
• Some results on the filter method for nonlinear complementary problems (Q2072787) (← links)
• \texttt{acados} -- a modular open-source framework for fast embedded optimal control (Q2125577) (← links)
• Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm (Q2138301) (← links)
• A new filter algorithm for a system of nonlinear equations (Q2204175) (← links)
• An augmented Lagrangian filter method (Q2216190) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
• On rigorous upper bounds to a global optimum (Q2250091) (← links)
• A first approach to learning a best basis for gravitational field modelling (Q2300570) (← links)
• A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization (Q2346503) (← links)
• A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints (Q2354192) (← links)
• A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization (Q2364355) (← links)
• Optimization of a fertilizer spreading process (Q2390408) (← links)
• A line search filter inexact SQP method for nonlinear equality constrained optimization (Q2391911) (← links)
• A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
• A filter line search algorithm based on an inexact Newton method for nonconvex equality constrained optimization (Q2401777) (← 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)
• A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization (Q2448469) (← links)
• Global convergence of a general filter algorithm based on an efficiency condition of the step (Q2453360) (← links)
• A line search filter approach for the system of nonlinear equations (Q2483084) (← 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)
• Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (Q2643614) (← links)
• Direct Multiple Shooting for Nonlinear Optimum Experimental Design (Q2801806) (← links)
• Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase (Q2805993) (← links)
• Numerical Determination of Extremal Points and Asymptotic Order of Discrete Minimal Riesz Energy for Regular Compact Sets (Q2950608) (← links)
• A selective strategy for shakedown analysis of engineering structures (Q2952284) (← links)
• Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming (Q2970395) (← links)
• An exact penalty-Lagrangian approach for large-scale nonlinear programming (Q2996800) (← links)
• AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
• Local convergence of filter methods for equality constrained non-linear programming (Q3066927) (← links)
• Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods (Q3089761) (← links)