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
Differential systems for constrained optimization via a nonlinear augmented Lagrangian, A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity, A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints, An exact penalty function based on the projection matrix, A dwindling filter trust region algorithm for nonlinear optimization, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity, A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization, Modular global optimisation in chemical engineering, Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints, A type of efficient feasible SQP algorithms for inequality constrained optimization, A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence, Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds, Interior-point algorithms, penalty methods and equilibrium problems, Piecewise linear NCP function for QP free feasible method, An interior-point penalty active-set trust-region algorithm, Test problem generator for unconstrained global optimization, A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, A simple feasible SQP algorithm for inequality constrained optimization, Biogeography-based optimization for constrained optimization problems, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, Solving unbounded box constrained variational inequalities via a homotopy method, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, The cross-entropy method for continuous multi-extremal optimization, A variable metric method for nonsmooth convex constrained optimization, A polynomial interior-point algorithm for monotone linear complementarity problems, Augmented penalty algorithms based on BFGS secant approximations and trust regions, Sequential penalty algorithm for nonlinear constrained optimization, A new discrete filled function algorithm for discrete global optimization, A double-multiplicative dynamic penalty approach for constrained evolutionary optimization, Discrete global descent method for discrete global optimization and nonlinear integer programming, CARTopt: a random search method for nonsmooth unconstrained optimization, A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, Improvements to single-objective constrained predator-prey evolutionary optimization algorithm, Pareto set analysis: local measures of objective coupling in multiobjective design optimization, PyOpt: a python-based object-oriented framework for nonlinear constrained optimization, A tri-dimensional filter SQP algorithm for variational inequality problems, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Global optimization of bilinear programs with a multiparametric disaggregation technique, A cautious BFGS update for reduced Hessian SQP, Globally convergent evolution strategies for constrained optimization, Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems, A derivative-free algorithm for linearly constrained optimization problems, A secant algorithm with line search filter method for nonlinear optimization, A filter secant method with nonmonotone line search for equality constrained optimization, A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization, Coupled eagle strategy and differential evolution for unconstrained and constrained global optimization, A polynomial arc-search interior-point algorithm for convex quadratic programming, A dwindling filter line search algorithm for nonlinear equality constrained optimization, On the local convergence of a derivative-free algorithm for least-squares minimization, Switching stepsize strategies for sequential quadratic programming, Extending and relating different approaches for solving fuzzy quadratic problems, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems, Global convergence of a nonmonotone filter method for equality constrained optimization, An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives, A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization, Interior-point methods for nonconvex nonlinear programming: cubic regularization, Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares, A working set SQCQP algorithm with simple nonmonotone penalty parameters, Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, Sequential quadratic programming methods for parametric nonlinear optimization, An extension of the Fletcher-Reeves method to linear equality constrained optimization problem, A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables, Inexact restoration method for nonlinear optimization without derivatives, Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization, An adaptive augmented Lagrangian method for large-scale constrained optimization, An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions, A modified weighted pairwise likelihood estimator for a class of random effects models, A penalty derivative-free algorithm for nonlinear constrained optimization, Conjugate gradient path method without line search technique for derivative-free unconstrained optimization, An inexact restoration derivative-free filter method for nonlinear programming, A new trust-region method for solving systems of equalities and inequalities, An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments, Sequential quadratic programming with a flexible step acceptance strategy, A robust implementation of a sequential quadratic programming algorithm with successive error restoration, The extrapolated interval global optimization algorithm, The use of QP-free algorithm in the limit analysis of slope stability, On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming, Solving nonlinear programming problems with noisy function values and noisy gradients, A modified SLP algorithm and its global convergence, Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming., Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints, Active-set projected trust-region algorithm for box-constrained nonsmooth equations, A modified QP-free feasible method, A new smoothing Newton method for solving constrained nonlinear equations, A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions, An SQP-filter method for inequality constrained optimization and its global convergence, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm, Sequential systems of linear equations method for general constrained optimization without strict complementarity, A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems, A trajectory-based method for constrained nonlinear optimization problems, An adaptive infeasible interior-point algorithm for linear complementarity problems, A restricted trust region algorithm for unconstrained optimization, A line search filter algorithm with inexact step computations for equality constrained optimization, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, The kidney model as an inverse problem, 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, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, ODE versus SQP methods for constrained optimization, How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results, Self-tuning norm-relaxed method of feasible directions, Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints, An interior-point implementation developed and tuned for radiation therapy treatment planning, An LQP-based two-step method for structured variational inequalities, Performance of several nonlinear programming software packages on microcomputers., Order-based error for managing ensembles of surrogates in mesh adaptive direct search, A tolerant algorithm for linearly constrained optimization calculations, Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function, Proximity control in bundle methods for convex nondifferentiable minimization, The dynamic-Q optimization method: an alternative to SQP?, A comparative performance evaluation of 27 nonlinear programming codes, Active set strategies in an ellipsoid algorithm for nonlinear programming, A smoothing QP-free infeasible method for nonlinear inequality constrained optimization, An analytical approach to global optimization, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, Successive linearization methods for large-scale nonlinear programming problems, Reduction of indefinite quadratic programs to bilinear programs, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization, An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, Variable sample size method for equality constrained optimization problems, Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, A bundle-filter method for nonsmooth convex constrained optimization, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, An interior-point method for solving box-constrained underdetermined nonlinear systems, Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints, An efficient sequential quadratic programming algorithm for nonlinear programming, Global and local convergence of a nonmonotone trust region algorithm for equality constrained optimization, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Global convergence of a robust filter SQP algorithm, On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions, A feasible interior-point algorithm for nonconvex nonlinear programming, A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization, Global convergence of a tri-dimensional filter SQP algorithm based on the line search method, Fuzzy costs in quadratic programming problems, Quasi-Newton acceleration for equality-constrained minimization, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, A filter-variable-metric method for nonsmooth convex constrained optimization, An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization, Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities, Value-estimation function method for constrained global optimization, Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions., Modified partial-update Newton-type algorithms for unary optimization, An NE/SQP method for the bounded nonlinear complementarity problem, A generalized conjugate gradient algorithm, Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization, Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization, A penalty-function-free line search SQP method for nonlinear programming, An interior point potential reduction method for constrained equations, On the resolution of monotone complementarity problems, On the convergence rate of Newton interior-point methods in the absence of strict complementarity, Generalized pattern search methods for a class of nonsmooth optimization problems with structure, Feasible direction interior-point technique for nonlinear optimization, Computational methods for optimum design of large complex systems, An XML-based schema for stochastic programs, A modified SQP method with nonmonotone technique and its global convergence, Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD, Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization, A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem, An SQP algorithm with cautious updating criteria for nonlinear degenerate problems, An efficient constraint handling method for genetic algorithms, A Newton-like method for nonlinear system of equations, A continuation method for (strongly) monotone variational inequalities, An SQP method for general nonlinear programs using only equality constrained subproblems, Pattern search ranking and selection algorithms for mixed variable simulation-based optimization, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions, A linear programming-based optimization algorithm for solving nonlinear programming problems, A generalization of the norm-relaxed method of feasible directions, Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization, A new technique for inconsistent QP problems in the SQP method, The LFOPC leap-frog algorithm for constrained optimization, Probabilistic version of the method of feasible directions., A reduced Hessian method for constrained optimization, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, An evaluation of back-propagation neural networks for the optimal design of structural systems. II: Numerical evaluation, Equality and inequality constrained optimization algorithms with convergent stepsizes, Nonmonotone line search for minimax problems, Continuation method for nonlinear complementarity problems via normal maps, 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 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, A globally convergent QP-free algorithm for nonlinear semidefinite programming, A modified augmented Lagrangian method for a class of monotone variational inequalities, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization, On combining feasibility, descent and superlinear convergence in inequality constrained optimization, A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization, Two differential equation systems for inequality constrained optimization, A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization, Global convergence of a new nonmonotone filter method for equality constrained optimization, New simple exact penalty function for constrained minimization, A penalty function-based differential evolution algorithm for constrained global optimization, A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization, A stable differential equation approach for inequality constrained optimization problems, An infeasible nonmonotone SSLE algorithm for nonlinear programming, Numerical experience with a polyhedral-norm CDT trust-region algorithm, Computing global minima to polynomial optimization problems using Gröbner bases, Solving nonlinearly constrained global optimization problem via an auxiliary function method, Numerical analysis of the orthogonal descent method, Constrained derivative-free optimization on thin domains, Approximate KKT points and a proximity measure for termination, Nonlinear complementarity as unconstrained optimization, Quantifying uncertainty with ensembles of surrogates for blackbox optimization, A second-order dynamical system for equilibrium problems, Randomness as source for inspiring solution search methods: music based approaches, Integral global minimization: Algorithms, implementations and numerical tests, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Computational experience with penalty-barrier methods for nonlinear programming, On the formulation and theory of the Newton interior-point method for nonlinear programming, Hybrid methods for large sparse nonlinear least squares, Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, Handling equality constraints in evolutionary optimization, Solving nonlinear multi-objective optimization problems with fuzzy relation inequality constraints regarding Archimedean triangular norm compositions, Derivative-free methods for bound constrained mixed-integer optimization, Convergence of a stabilized SQP method for equality constrained optimization, Constrained dogleg methods for nonlinear systems with simple bounds, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, A regularization method for constrained nonlinear least squares, An improved feasible QP-free algorithm for inequality constrained optimization, A non-monotone line search multidimensional filter-SQP method for general nonlinear programming, An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints, A variant of SQP method for inequality constrained optimization and its global convergence, Benchmarking nonlinear optimization software in technical computing environments, Explicit convex and concave envelopes through polyhedral subdivisions, Improved quantum-inspired evolutionary algorithm for engineering design optimization, An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians, A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization, A new class of exact penalty functions and penalty algorithms, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization, A multiplier active-set trust-region algorithm for solving constrained optimization problem, A variable target value method for nondifferentiable optimization, A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application, A primal-dual modified log-barrier method for inequality constrained nonlinear optimization, A new penalty method for nonlinear programming, A new class of test functions for global optimization, A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization, Combining cross-entropy and MADS methods for inequality constrained global optimization, Memetic particle swarm optimization, Differential equation method based on approximate augmented Lagrangian for nonlinear programming, Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization, A global convergence of LS-CD hybrid conjugate gradient method, A sequential equality constrained quadratic programming algorithm for inequality constrained optimization, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, A review of linear and nonlinear Cauchy singular integral and integro-differential equations arising in mechanics, A polynomial path following algorithm for convex programming, A sequential quadratically constrained quadratic programming method of feasible directions, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, Discrete filled function method for discrete global optimization, A feasible trust-region algorithm for inequality constrained optimization, A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization, A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations, A new trust region method for solving least-square transformation of system of equalities and inequalities, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming, A class on nonmonotone stabilization methods in unconstrained optimization, A new sampling-based RBDO method via score function with reweighting scheme and application to vehicle designs, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation, A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints, A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints, Monotonic grey box direct search optimization, A modified Nelder-Mead barrier method for constrained optimization, A power penalty approach to a discretized obstacle problem with nonlinear constraints, A new smoothing method for solving nonlinear complementarity problems, Linear equalities in blackbox optimization, Derivative-free methods for mixed-integer constrained optimization problems, An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, An affine scaling trust-region approach to bound-constrained nonlinear systems, Global Newton-type methods and semismooth reformulations for NCP, Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming, Adaptive algorithm for constrained least-squares problems, Attracting sets in index 2 differential algebraic equations and in their Runge-Kutta discretizations, A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Univariate parameterization for global optimization of mixed-integer polynomial problems, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints
