Pages that link to "Item:Q1148785"

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

Displaying 50 items.

• An affine scaling trust-region approach to bound-constrained nonlinear systems (Q1861959) (← links)
• Global Newton-type methods and semismooth reformulations for NCP (Q1861964) (← links)
• Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming (Q1862179) (← links)
• Adaptive algorithm for constrained least-squares problems (Q1862189) (← links)
• Attracting sets in index 2 differential algebraic equations and in their Runge-Kutta discretizations (Q1863495) (← links)
• A modified augmented Lagrangian method for a class of monotone variational inequalities (Q1876157) (← links)
• A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization (Q1883470) (← links)
• A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization (Q1888512) (← links)
• Numerical experience with a polyhedral-norm CDT trust-region algorithm (Q1896572) (← links)
• Computing global minima to polynomial optimization problems using Gröbner bases (Q1904644) (← links)
• Numerical analysis of the orthogonal descent method (Q1905135) (← links)
• Nonlinear complementarity as unconstrained optimization (Q1908649) (← links)
• Integral global minimization: Algorithms, implementations and numerical tests (Q1913610) (← links)
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
• Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) (← links)
• On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
• Hybrid methods for large sparse nonlinear least squares (Q1918021) (← links)
• Handling equality constraints in evolutionary optimization (Q1926880) (← links)
• Solving nonlinear multi-objective optimization problems with fuzzy relation inequality constraints regarding Archimedean triangular norm compositions (Q1927269) (← links)
• Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
• Constrained dogleg methods for nonlinear systems with simple bounds (Q1935576) (← links)
• An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
• Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• Improved quantum-inspired evolutionary algorithm for engineering design optimization (Q1955250) (← links)
• An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians (Q1955564) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• A variable target value method for nondifferentiable optimization (Q1970420) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
• Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization (Q2013811) (← links)
• A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations (Q2013818) (← links)
• A new trust region method for solving least-square transformation of system of equalities and inequalities (Q2017830) (← links)
• A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations (Q2019006) (← links)
• A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming (Q2023745) (← links)
• Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) (← links)
• A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
• A second-order dynamical system for equilibrium problems (Q2163461) (← links)
• Randomness as source for inspiring solution search methods: music based approaches (Q2164554) (← links)
• Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification (Q2191793) (← links)
• A regularization method for constrained nonlinear least squares (Q2191800) (← links)
• An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints (Q2200796) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
• A primal-dual modified log-barrier method for inequality constrained nonlinear optimization (Q2228414) (← links)
• Differential equation method based on approximate augmented Lagrangian for nonlinear programming (Q2244211) (← links)
• Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization (Q2244360) (← links)
• A global convergence of LS-CD hybrid conjugate gradient method (Q2248683) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)