scientific article

zbMath0474.65043MaRDI QIDQ3928936

Roger Fletcher

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrange multipliersconstrained optimizationmultiplier methodssimplex methodlarge sparse problemsbranch and bound methodactive set methodfeasible direction methodsnon-differentiable optimization problempenalty and barrier function methods

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Related Items

Likelihood-based confidence regions for log-linear models, A class of algorithms for large scale nonlinear minimax optimization, Two methods for large-scale nonlinear optimization and their comparison on a case study of hydropower optimization, An exact penalty function based on the projection matrix, A recursive quadric programming algorithm that uses new nondifferentiable penalty functions, QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming, Nonmonotone trust region method for solving optimization problems, Experiments with successive quadratic programming algorithms, On the exactness of a class of nondifferentiable penalty functions, A sparse sequential quadratic programming algorithm, A projected Newton method for minimization problems with nonlinear inequality constraints, An M-objective penalty function algorithm under big penalty parameters, Superlinear convergence of a trust region type successive linear programming method, Optimization algorithms for a class of nonlinear programming problems, Descent methods with linesearch in the presence of perturbations, Parameter-dependent transitions and the optimal control of dynamical diseases, Dynamic traffic assignment: Considerations on some deterministic modelling approaches, A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems, On the entropic regularization method for solving min-max problems with applications, On KKT points of Celis-Dennis-Tapia subproblem, Trust region algorithm for nonsmooth optimization, Non-parametric estimation of the frequency-response functions of the linear blocks of a Wiener-Hammerstein model, Recent developments in constrained optimization, Determination of shape preserving spline interpolants with minimal curvature via dual programs, Linear programming via least squares, Estimation of eddy viscosity coefficient in a periodic shallow water equation, The relationship between terminal state constraints and penalties for the discrete-time LQP problem associated with the adjustment of accelerometer data, High order sensitivity analysis in shape optimization problems, Extreme learning machines on high dimensional and large data applications: a survey, One-class classification with extreme learning machine, A gradient-type algorithm for constrained optimization with application to microstructure optimization, Optimality conditions for a class of composite multiobjective nonsmooth optimization problems, Post-boosting of classification boundary for imbalanced data using geometric mean, Using an iterative linear solver in an interior-point method for generating support vector machines, A trust-region framework for constrained optimization using reduced order modeling, Unconstrained formulation of standard quadratic optimization problems, A tensor decomposition approach to data compression and approximation of ND systems, Copositive optimization -- recent developments and applications, A dynamic system model for solving convex nonlinear optimization problems, An objective penalty function of bilevel programming, A primal-dual augmented Lagrangian, Global convergence of a semi-infinite optimization method, FaSa: A fast and stable quadratic placement algorithm, Globally convergent methods for semi-infinite programming, A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization, A note on the regularization of discrete approximation problems, An acceleration method for ten Berge et al.'s algorithm for orthogonal INDSCAL, On a subproblem of trust region algorithms for constrained optimization, A null space method for solving system of equations., A globally convergent algorithm based on imbedding and parametric optimization, A dynamical model for solving degenerate quadratic minimax problems with constraints, A successive quadratic programming method for a class of constrained nonsmooth optimization problems, Distribution of event times in time-resolved fluorescence: The exponential series approach --- algorithm, regularization, analysis, A quadratic objective penalty function for bilevel programming, A new objective penalty function approach for solving constrained minimax problems, Successive linearization methods for large-scale nonlinear programming problems, Solution of projection problems over polytopes, Local minima for indefinite quadratic knapsack problems, Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, An exact penalty algorithm for recourse-constrained stochastic linear programs, Constrained and unconstrained optimization formulations for structural elements in unilateral contact with an elastic foundation, Rank revealing \(LU\) factorizations, Analytical existence of solutions to a system of nonlinear equations with application, An exact penalty method for free terminal time optimal control problem with continuous inequality constraints, A new semi-penalty method for nonlinear programming, A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems, A new filled function method for constrained nonlinear equations, The probabilistic constraints in the support vector machine, A fast MPC algorithm using nonfeasible active set methods, A globally convergent SQP method for semi-infinite nonlinear optimization, An objective penalty function method for biconvex programming, A globally convergent algorithm for MPCC, A practical anti-cycling procedure for linearly constrained optimization, Engineering applications of discrete time optimal control, Computational study of a family of mixed-integer quadratic programming problems, A super-linear convergent gradient projection type algorithm for linearly constrained problems, Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming, A robust sequential quadratic programming method, Quasi-Newton trust region algorithm for non-smooth least squares problems, Application of gradient descent method to the sedimentary grain-size distribution fitting, An approximate algorithm for computing multidimensional convex hulls, High-order shape design sensitivity: A unified approach, Globally convergent decomposition methods for nonconvex optimization problems, An integrated perturbation analysis and sequential quadratic programming approach for model predictive control, Filled functions for unconstrained global optimization, A note on solving nonlinear minimax problems via a differentiable penalty function, An algorithm for composite nonsmooth optimization problems, Convex spline interpolants with minimal curvature, Solving the minimal least squares problem subject to bounds on the variables, More on restricted canonical correlations, A quadratic approximation method for minimizing a class of quasidifferentiable functions, One-shot airfoil optimisation without adjoint, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, On the limit products of a family of matrices, The kidney model as an inverse problem, Using copositivity for global optimality criteria in concave quadratic programming problems, Sequential quadratic programming methods for optimal control problems with state constraints, Role of copositivity in optimality criteria for nonconvex optimization problems, A comparison of Kriging with nonparametric regression methods, Conditions for convergence of trust region algorithms for nonsmooth optimization, On the superlinear convergence of a trust region algorithm for nonsmooth optimization, On the solution of Nonlinear Programming Problems with Equality Constraints Via Continuation Using Special LU Factorization, CDT like approaches for the system of nonlinear equations, Incomplete pairwise comparison and consistency optimization, A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems, New simple exact penalty function for constrained minimization, Multiple models, multiplicative noise and linear quadratic control—algorithmic aspects, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, Use of exact penalty functions to determine efficient decisions, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, A successive quadratic programming algorithm with global and superlinear convergence properties, Exactness and algorithm of an objective penalty function, On the origins of intersecting potential energy surfaces, CACE tool for multi-input, multi-output systems using a new vector optimization method, Nonparametric density estimation for censored survival data: Regression‐spline approach, Karmarkar's projective method for linear programming: a computational survey, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, Continuous-time portfolio optimization under terminal wealth constraints, Local properties of inexact methods for minimizing nonsmooth composite functions, An immersed boundary element method for level-set based topology optimization, Two diagonal conjugate gradient like methods for unconstrained optimization, Matrix criterion robust linear quadratic control problem, On the Solution of Nonlinear Programming Problems Via Continuation Using Special LU Factorization, Analytic stress solutions for a lined circular tunnel under frictional slip contact conditions, New DY-HS hybrid conjugate gradient algorithm for solving optimization problem of unsteady partial differential equations with convection term, ImplementableL_∞penalty-function method for semi-infinite optimization, Projected gradient methods for linearly constrained problems, Optimal control of three-dimensional unsteady partial differential equations with convection term in continuous casting, Spatiotemporal vaccine allocation policies for epidemics with behavioral feedback dynamics, A modified trust region method with beale's PCG technique for optimization, A machine learning-based probabilistic computational framework for uncertainty quantification of actuation of clustered tensegrity structures, The evaluation complexity of finding high-order minimizers of nonconvex optimization, The restricted generalized inverses corresponding to constrained quadratic system^∗, Bifurcation problems in nonlinear parametric programming, Second order necessary and sufficient conditions for convex composite NDO, Analog circuit optimization on basis of control theory approach, The optimality conditions for generalized minimax programming, Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, A new penalty method for nonlinear programming, New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints, A trust region SQP algorithm for mixed-integer nonlinear programming, An SQP approach with line search for a system of nonlinear equations, Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, A simple algebraic proof of Farkas's lemma and related theorems, Approximation by circles, On generic quadratic penalty embeddings for nonlinear optimization problems, Variable programming: a generalized minimax problem. I: Models and theory, On the variational process in parameter optimization, On nonlinearity and eliminating linear components from nonlinear systems, Unnamed Item, Nonlinear programming and nonsmooth optimization by successive linear programming, Efficient optimization of support vector machine learning parameters for unbalanced datasets, The explicit linear quadratic regulator for constrained systems, Functions and sets of smooth substructure: relationships and examples, Augmented Lagrangian Objective Penalty Function, Exact penalty functions and Lagrange multipliers, Kalman filter constraint switching for turbofan engine health estimation, Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming, Optimization of the domain in elliptic problems by the dual finite element method, A gain modification form for Kalman filtering under state inequality constraints, New constraint qualifications with second-order properties in nonlinear optimization, Application of Optimisation Algorithms to Aircraft Aerodynamics, An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function, Recent advances in trust region algorithms, Local properties of algorithms for minimizing nonsmooth composite functions, Scoring with constraints, Smoothing Approximation to the New Exact Penalty Function with Two Parameters, A projected lagrangian algorithm for semi-infinite programming, Stable modification of explicitLU factors for simplex updates