Pages that link to "Item:Q1148785"

The following pages link to Test examples for nonlinear programming codes (Q1148785):

Displaying 50 items.

• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A robust trust region method for nonlinear optimization with inequality constraint (Q2496002) (← links)
• A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
• A trust-region and affine scaling algorithm for linearly constrained optimization (Q2503848) (← links)
• An interior trust region algorithm for solving linearly constrained nonlinear optimization (Q2504105) (← links)
• A truncated conjugate gradient method with an inexact Gauss-Newton technique for solving nonlinear systems (Q2511034) (← links)
• A line search SQP method without a penalty or a filter (Q2516801) (← links)
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set (Q2518117) (← links)
• A smoothing homotopy method for solving variational inequalities (Q2518571) (← links)
• A primal-dual interior-point algorithm for nonlinear least squares constrained problems (Q2568604) (← links)
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
• Huber approximation for the non-linear \(l_{1}\) problem (Q2572881) (← links)
• A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games (Q2641225) (← links)
• Improved convergence order for augmented penalty algorithms (Q2655402) (← links)
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates (Q2687061) (← links)
• The Gauss-Newton Methods via Conjugate Gradient Path without Line Search Technique for Solving Nonlinear Systems (Q2987788) (← links)
• A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
• A nonmonotone SQP-filter method for equality constrained optimization (Q3066990) (← links)
• A globally convergent non-interior point homotopy method for solving variational inequalities (Q3096888) (← links)
• Structural optimization using a new local approximation method (Q3122364) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization (Q3462308) (← links)
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
• (Q3660803) (← links)
• Numerical solution of an inverse problem connected with continuous casting of steel (Q3720330) (← links)
• Performance of some SQP algorithms on structural design problems (Q3735218) (← links)
• Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens (Q3747244) (← links)
• A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
• ε-Optimal solutions in nondifferentiable convex programming and some related questions (Q3959749) (← links)
• A quadratic programming algorithm for large and sparse problems (Q3978055) (← links)
• The method of common descent for a certain class of quasidifferentiable functions (Q3979520) (← links)
• (Q4360542) (← links)
• FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS (Q4360561) (← links)
• A Trust Regional Algorithm for Bound Constrained Minimization (Q4361043) (← links)
• An efficient dynamical evolutionary algorithm for global optimization (Q4467339) (← links)
• An approach to multi-start clustering for global optimization with non-linear constraints (Q4530126) (← links)
• État de l'art des méthodes “d'optimisation globale” (Q4531458) (← links)
• A Robust Algorithm for Solving Nonlinear Programming Problems (Q4543516) (← links)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• Penalty-free method for nonsmooth constrained optimization via radial basis functions (Q4633326) (← links)
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables (Q4634101) (← links)
• A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
• A Regularized Factorization-Free Method for Equality-Constrained Optimization (Q4641674) (← links)
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization (Q4653552) (← links)
• A new semismooth Newton method for NCPs based on the penalized KK function (Q4903557) (← links)
• A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
• Resolution of nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints using genetic algorithm (Q4963121) (← links)
• Handling of Constraints in Efficient Global Optimization (Q4987284) (← links)
• An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization (Q5028601) (← links)