Pages that link to "Item:Q847849"

The following pages link to Nonlinear programming without a penalty function or a filter (Q847849):

Displaying 44 items.

• A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
• A new penalty-free-type algorithm based on trust region techniques (Q387487) (← links)
• Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
• Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
• qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
• An interior-point trust-funnel algorithm for nonlinear optimization (Q507313) (← links)
• Algorithm for calculating the analytic solution for economic dispatch with multiple fuel units (Q660866) (← links)
• Erratum to: ``Nonlinear programming without a penalty function or a filter'' (Q662297) (← links)
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
• Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
• A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
• On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization (Q1633865) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• A penalty-free method with line search for nonlinear equality constrained optimization (Q1792357) (← links)
• A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations (Q2019006) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
• An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
• DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
• Linear equalities in blackbox optimization (Q2340487) (← links)
• A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• Constrained derivative-free optimization on thin domains (Q2392122) (← links)
• Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← 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)
• On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization (Q2634338) (← links)
• Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints (Q2815544) (← links)
• On the Connection Between Forward and Optimization Problem in One-shot One-step Methods (Q2961051) (← links)
• Penalty-free method for nonsmooth constrained optimization via radial basis functions (Q4633326) (← links)
• Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization (Q4641670) (← links)
• A central path interior point method for nonlinear programming and its local convergence (Q5028593) (← links)
• A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
• A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming (Q5245841) (← links)
• On the behaviour of constrained optimization methods when Lagrange multipliers do not exist (Q5746720) (← links)
• A line search exact penalty method with bi-object strategy for nonlinear constrained optimization (Q5964608) (← links)
• A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold (Q6120009) (← links)
• A local MM subspace method for solving constrained variational problems in image recovery (Q6162148) (← links)
• An overview of nonlinear optimization (Q6200213) (← links)