Pages that link to "Item:Q1148785"
From MaRDI portal
The following pages link to Test examples for nonlinear programming codes (Q1148785):
Displaying 50 items.
- An SQP-filter method for inequality constrained optimization and its global convergence (Q555460) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727) (← links)
- Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems (Q616036) (← links)
- A secant algorithm with line search filter method for nonlinear optimization (Q622928) (← links)
- A filter secant method with nonmonotone line search for equality constrained optimization (Q625685) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
- Extending and relating different approaches for solving fuzzy quadratic problems (Q635935) (← links)
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization (Q668547) (← links)
- An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions (Q671194) (← links)
- Sequential quadratic programming with a flexible step acceptance strategy (Q693514) (← links)
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming (Q700757) (← links)
- Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
- Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming. (Q703159) (← links)
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q704198) (← links)
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations (Q704744) (← links)
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions (Q706948) (← links)
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems (Q725814) (← links)
- A trajectory-based method for constrained nonlinear optimization problems (Q725880) (← links)
- An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
- A restricted trust region algorithm for unconstrained optimization (Q761253) (← links)
- A line search filter algorithm with inexact step computations for equality constrained optimization (Q765270) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis (Q790580) (← links)
- The kidney model as an inverse problem (Q809915) (← links)
- A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints (Q824557) (← links)
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
- Modular global optimisation in chemical engineering (Q842720) (← links)
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints (Q842762) (← links)
- A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
- Interior-point algorithms, penalty methods and equilibrium problems (Q853552) (← links)
- Piecewise linear NCP function for QP free feasible method (Q854563) (← links)
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
- A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
- The cross-entropy method for continuous multi-extremal optimization (Q861537) (← links)
- A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
- Augmented penalty algorithms based on BFGS secant approximations and trust regions (Q870306) (← links)
- A new discrete filled function algorithm for discrete global optimization (Q875372) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- A cautious BFGS update for reduced Hessian SQP (Q885498) (← links)
- Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
- A dwindling filter line search algorithm for nonlinear equality constrained optimization (Q904938) (← links)
