Publication:3928936
From MaRDI portal
zbMath0474.65043MaRDI QIDQ3928936
Publication date: 1981
Lagrange multipliers; constrained optimization; multiplier methods; simplex method; large sparse problems; branch and bound method; active set method; feasible direction methods; non-differentiable optimization problem; penalty and barrier function methods
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
90Cxx: Mathematical programming
65Kxx: Numerical methods for mathematical programming, optimization and variational techniques
Related Items
On the Solution of Nonlinear Programming Problems Via Continuation Using Special LU Factorization, The restricted generalized inverses corresponding to constrained quadratic system∗, Scoring with constraints, Continuous-time portfolio optimization under terminal wealth constraints, On the solution of Nonlinear Programming Problems with Equality Constraints Via Continuation Using Special LU Factorization, Approximation by circles, On the variational process in parameter optimization, The explicit linear quadratic regulator for constrained systems, Second order necessary and sufficient conditions for convex composite NDO, Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, A simple algebraic proof of Farkas's lemma and related theorems, Unnamed Item, Multiple models, multiplicative noise and linear quadratic control—algorithmic aspects, Nonparametric density estimation for censored survival data: Regression‐spline approach, A new semi-penalty method for nonlinear programming, Engineering applications of discrete time optimal control, A super-linear convergent gradient projection type algorithm for linearly constrained problems, Globally convergent decomposition methods for nonconvex optimization problems, A note on solving nonlinear minimax problems via a differentiable penalty function, Solving the minimal least squares problem subject to bounds on the variables, The kidney model as an inverse problem, On KKT points of Celis-Dennis-Tapia subproblem, Global convergence of a semi-infinite optimization method, A note on the regularization of discrete approximation problems, On a subproblem of trust region algorithms for constrained optimization, Constrained and unconstrained optimization formulations for structural elements in unilateral contact with an elastic foundation, An algorithm for composite nonsmooth optimization problems, Convex spline interpolants with minimal curvature, A quadratic approximation method for minimizing a class of quasidifferentiable functions, A comparison of Kriging with nonparametric regression methods, Likelihood-based confidence regions for log-linear models, A class of algorithms for large scale nonlinear minimax optimization, 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, Superlinear convergence of a trust region type successive linear programming method, Optimization algorithms for a class of nonlinear programming problems, Parameter-dependent transitions and the optimal control of dynamical diseases, A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems, Recent developments in constrained optimization, Determination of shape preserving spline interpolants with minimal curvature via dual programs, Linear programming via least squares, 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, Globally convergent methods for semi-infinite programming, A globally convergent algorithm based on imbedding and parametric optimization, 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, 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, Rank revealing \(LU\) factorizations, A globally convergent SQP method for semi-infinite nonlinear optimization, A practical anti-cycling procedure for linearly constrained optimization, An approximate algorithm for computing multidimensional convex hulls, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, 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, Two methods for large-scale nonlinear optimization and their comparison on a case study of hydropower optimization, A recursive quadric programming algorithm that uses new nondifferentiable penalty functions, Descent methods with linesearch in the presence of perturbations, On the entropic regularization method for solving min-max problems with applications, Trust region algorithm for nonsmooth optimization, Non-parametric estimation of the frequency-response functions of the linear blocks of a Wiener-Hammerstein model, FaSa: A fast and stable quadratic placement algorithm, A null space method for solving system of equations., Quasi-Newton trust region algorithm for non-smooth least squares problems, High-order shape design sensitivity: A unified approach, Filled functions for unconstrained global optimization, More on restricted canonical correlations, Computational study of a family of mixed-integer quadratic programming problems, Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming, A robust sequential quadratic programming method, One-shot airfoil optimisation without adjoint, On the limit products of a family of matrices, Nonmonotone trust region method for solving optimization problems, Dynamic traffic assignment: Considerations on some deterministic modelling approaches, Estimation of eddy viscosity coefficient in a periodic shallow water equation, Nonlinear programming and nonsmooth optimization by successive linear programming, CDT like approaches for the system of nonlinear equations, Incomplete pairwise comparison and consistency optimization, A modified trust region method with beale's PCG technique for optimization, A new penalty method for nonlinear programming, A trust region SQP algorithm for mixed-integer nonlinear programming, An SQP approach with line search for a system of nonlinear equations, Variable programming: a generalized minimax problem. I: Models and theory, Efficient optimization of support vector machine learning parameters for unbalanced datasets, Functions and sets of smooth substructure: relationships and examples, Use of exact penalty functions to determine efficient decisions, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, On generic quadratic penalty embeddings for nonlinear optimization problems, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, On nonlinearity and eliminating linear components from nonlinear systems, Exact penalty functions and Lagrange multipliers, CACE tool for multi-input, multi-output systems using a new vector optimization method, Karmarkar's projective method for linear programming: a computational survey, Unnamed Item, Local properties of algorithms for minimizing nonsmooth composite functions, A projected lagrangian algorithm for semi-infinite programming, Stable modification of explicitLU factors for simplex updates, Conditions for convergence of trust region algorithms for nonsmooth optimization, On the superlinear convergence of a trust region algorithm for nonsmooth optimization, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, A successive quadratic programming algorithm with global and superlinear convergence properties, Local properties of inexact methods for minimizing nonsmooth composite functions, Matrix criterion robust linear quadratic control problem, ImplementableL∞penalty-function method for semi-infinite optimization, Projected gradient methods for linearly constrained problems, Bifurcation problems in nonlinear parametric programming
