Test examples for nonlinear programming codes
From MaRDI portal
Publication:1148785
zbMath0452.90038MaRDI QIDQ1148785
Klaus Schittkowski, Willi Hock
Publication date: 1981
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity ⋮ Global optimization for mixed categorical-continuous variables based on Gaussian process models with a randomized categorical space exploration step ⋮ Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions ⋮ Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem ⋮ An approach to multi-start clustering for global optimization with non-linear constraints ⋮ État de l'art des méthodes “d'optimisation globale” ⋮ The method of common descent for a certain class of quasidifferentiable functions ⋮ FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS ⋮ A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality ⋮ A Robust Algorithm for Solving Nonlinear Programming Problems ⋮ Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ Numerical solution of an inverse problem connected with continuous casting of steel ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization ⋮ A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games ⋮ Performance of some SQP algorithms on structural design problems ⋮ Unnamed Item ⋮ Improved convergence order for augmented penalty algorithms ⋮ Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ A two-stage feasible directions algorithm for nonlinear constrained optimization ⋮ A novel data-driven visualization of \(n\)-dimensional feasible region using interpretable self-organizing maps (iSOM) ⋮ Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ A merit function approach for evolution strategies ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ A derivative-free algorithm for non-linear optimization with linear equality constraints ⋮ Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems ⋮ Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates ⋮ Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization ⋮ A derivative-free modified tensor method with curvilinear linesearch for unconstrained nonlinear programming ⋮ Unnamed Item ⋮ A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions ⋮ The Gauss-Newton Methods via Conjugate Gradient Path without Line Search Technique for Solving Nonlinear Systems ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ A Trust Regional Algorithm for Bound Constrained Minimization ⋮ Penalty-free method for nonsmooth constrained optimization via radial basis functions ⋮ Unnamed Item ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ A new semismooth Newton method for NCPs based on the penalized KK function ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function ⋮ Constructing test functions for global optimization using continuous formulations of graph problems ⋮ An interior global method for nonlinear systems with simple bounds ⋮ A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization ⋮ Unnamed Item ⋮ An ellipsoid algorithm for equality-constrained nonlinear programs ⋮ A superlinearly convergent method of feasible directions. ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ A robust trust region method for nonlinear optimization with inequality constraint ⋮ A sequential cutting plane algorithm for solving convex NLP problems ⋮ Unnamed Item ⋮ Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets ⋮ A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization ⋮ A potential reduction algorithm for linearly constrained convex programming ⋮ A projected-search interior-point method for nonlinearly constrained optimization ⋮ Duality in convex optimization for the hyperbolic augmented Lagrangian ⋮ A trust-region and affine scaling algorithm for linearly constrained optimization ⋮ An interior trust region algorithm for solving linearly constrained nonlinear optimization ⋮ Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization ⋮ Hybrid Newton-type method for a class of semismooth equations ⋮ A truncated conjugate gradient method with an inexact Gauss-Newton technique for solving nonlinear systems ⋮ A nonmonotone SQP-filter method for equality constrained optimization ⋮ A line search SQP method without a penalty or a filter ⋮ A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization ⋮ Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set ⋮ Practical implementation of an interior point nonmonotone line search filter method ⋮ A smoothing homotopy method for solving variational inequalities ⋮ A globally convergent non-interior point homotopy method for solving variational inequalities ⋮ Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables ⋮ An efficient dynamical evolutionary algorithm for global optimization ⋮ Handling of Constraints in Efficient Global Optimization ⋮ Nonmonotone conic trust region method with line search technique for bound constrained optimization ⋮ A Collection of Test Multiextremal Optimal Control Problems ⋮ A primal-dual interior-point algorithm for nonlinear least squares constrained problems ⋮ A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ Huber approximation for the non-linear \(l_{1}\) problem ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ Unnamed Item ⋮ An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization ⋮ ε-Optimal solutions in nondifferentiable convex programming and some related questions ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints ⋮ Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ A class of test functions for global optimization ⋮ A two-parameter exact penalty function for nonlinear programming ⋮ Corrected sequential linear programming for sparse minimax optimization ⋮ Norm-relaxed method of feasible directions for solving nonlinear programming problems ⋮ On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization ⋮ Penalty functions, Newton's method, and quadratic programming ⋮ A heuristic algorithm for nonlinear programming ⋮ Monte Carlo optimization ⋮ A sparse sequential quadratic programming algorithm ⋮ Best practices for comparing optimization algorithms ⋮ Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems ⋮ Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
This page was built for publication: Test examples for nonlinear programming codes
