scientific article
From MaRDI portal
Publication:3928936
zbMath0474.65043MaRDI QIDQ3928936
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrange multipliersconstrained optimizationmultiplier methodssimplex methodlarge sparse problemsbranch and bound methodactive set methodfeasible direction methodsnon-differentiable optimization problempenalty and barrier function methods
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 (only showing first 100 items - show all)
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
This page was built for publication:
