The following pages link to (Q4226179):
Displayed 50 items.
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727) (← links)
- A new iterative procedure for the numerical solution of coefficient inverse problems (Q557949) (← links)
- Cubic splines with minimal norm. (Q558555) (← links)
- Software for the computation of Tobit model estimates (Q585639) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- High order interpolation and differentiation using B-splines (Q598146) (← links)
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Linear M-estimation with bounded variables (Q678208) (← links)
- Convex composite multi-objective nonsmooth programming (Q687035) (← links)
- A stochastic model of hormesis (Q688463) (← links)
- An experimental evaluation of neural networks for classification (Q690022) (← links)
- Global convergence of a two-parameter family of conjugate gradient methods without line search (Q697544) (← links)
- Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
- Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization (Q700177) (← links)
- Alternating direction method for maximum entropy subject to simple constraint sets. (Q703173) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- Minimum cost trajectory planning for industrial robots (Q704356) (← links)
- An efficient method for nonlinearly constrained networks (Q706946) (← links)
- Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
- Extended fuzzy regression models using regularization method (Q707331) (← links)
- The filled function transformations for constrained global optimization (Q751199) (← links)
- On the numerical realization of the exact penalty method for quadratic programming algorithms (Q751516) (← links)
- Bifurcations in parametric nonlinear programming (Q753690) (← links)
- A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer (Q809551) (← links)
- On the use of curvature estimates in quasi-Newton methods (Q809553) (← links)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems (Q810375) (← links)
- Estimating the matrix \(p\)-norm (Q811644) (← links)
- The use of alternation and recurrences in two-step quasi-Newton methods (Q815228) (← links)
- Three-step fixed-point quasi-Newton methods for unconstrained optimisation (Q815230) (← links)
- Objective fuzzy subsets and an algorithm for partial linear programming (Q816885) (← links)
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
- Calmness and exact penalization in vector optimization with cone constraints (Q853669) (← links)
- Optimizing preventive maintenance models (Q853881) (← links)
- Enlarging the terminal region of nonlinear model predictive control using the support vector machine method (Q857150) (← links)
- Primal-dual active-set algorithm for chemical equilibrium problems related to the modeling of atmospheric inorganic aerosols (Q857583) (← links)
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints (Q858574) (← links)
- Evaluation of neural networks and data mining methods on a credit assessment task for class imbalance problem (Q859574) (← links)
- Spherical parametrization of genus-zero meshes by minimizing discrete harmonic energy (Q863842) (← links)
- Sequential penalty quadratic programming filter methods for nonlinear programming (Q864206) (← links)
- A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- Maximum-entropy clustering algorithm and its global convergence analysis (Q866225) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- Modeling and optimizing a vendor managed replenishment system using machine learning and genetic algorithms (Q869164) (← links)
- Augmented penalty algorithms based on BFGS secant approximations and trust regions (Q870306) (← links)
- Simultaneous modelling of the Cholesky decomposition of several covariance matrices (Q873623) (← links)
- A hybrid simplex search and particle swarm optimization for unconstrained optimization (Q877028) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- Solving nonlinear portfolio optimization problems with the primal-dual interior point method (Q877584) (← links)