scientific article
From MaRDI portal
Publication:3677502
zbMath0563.90068MaRDI QIDQ3677502
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Newton's methodrates of convergenceSensitivity analysisconstrained problemsUnconstrained optimizationGeometric programmingtext bookConjugate direction algorithmsFirst- and second-order optimality conditionsSequential unconstrained minimization techniquesVariable-reduction algorithms
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Numerical methods in optimal control (49Mxx)
Related Items (64)
Feature extraction algorithms for constrained global optimization. I: Mathematical foundation ⋮ Finite difference schemes for long-time integration ⋮ Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ Use of a mixture model for the analysis of contraceptive-use duration among long-term users ⋮ Polynomial approximation technique for dynamic optimization problems ⋮ Unnamed Item ⋮ On inertia and Schur complement in optimization ⋮ Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities ⋮ Second-order sensitivity analysis in factorable programming: Theory and applications ⋮ MixedH2/H∞control under variance constraints ⋮ A Gauss-Seidel type solver for special convex programs, with application to frictional contact mechanics ⋮ A method of Euclidean centers ⋮ Flexible smoothing with periodic cubic splines and fitting with closed curves ⋮ A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices ⋮ A branch-and-reduce approach to global optimization ⋮ Ratio combinatorial programs ⋮ A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem ⋮ Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ Penalized likelihood estimation and iterative Kalman smoothing for non-Gaussian dynamic regression models ⋮ Bifurcation problems in nonlinear parametric programming ⋮ An integer linear programming approach for bilinear integer programming ⋮ Global optimization of bounded factorable functions with discontinuities ⋮ A chance-constrained approach to stock selection in Hong Kong ⋮ Convergence rate of McCormick relaxations ⋮ A general projection framework for constrained smoothing. ⋮ LP-form inclusion functions for global optimization ⋮ Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems ⋮ Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras ⋮ High dimensional model representation constructed by support vector regression. I. Independent variables with known probability distributions ⋮ Sensitivity analysis of constrained linear \(L_1\) regression: perturbations to response and predictor variables ⋮ The demand weighted vehicle routing problem ⋮ Multivariate McCormick relaxations ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ Calculation of bounds on variables satisfying nonlinear inequality constraints ⋮ A sequential parametric convex approximation method with applications to nonconvex truss topology design problems ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ Global solution of optimization problems with parameter-embedded linear dynamic systems. ⋮ Extended fuzzy regression models using regularization method ⋮ Unnamed Item ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ On parametric nonlinear programming ⋮ Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints. ⋮ A potential reduction algorithm for linearly constrained convex programming ⋮ Unnamed Item ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function ⋮ Integral global optimization method in statistical applications ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ A hybrid genetic algorithm for a type of nonlinear programming problem ⋮ The filled function transformations for constrained global optimization ⋮ The globally convexized filled functions for global optimization ⋮ Nonmonotone curvilinear line search methods for unconstrained optimization ⋮ Process planning in a fuzzy environment ⋮ Multi-objective optimization over convex disjunctive feasible sets using reference points ⋮ Enhancing numerical constraint propagation using multiple inclusion representations ⋮ Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints ⋮ A numerical method for parameter identification of a boundary value problem ⋮ Degeneracy in NLP and the development of results motivated by its presence ⋮ Global multi-parametric optimal value bounds and solution estimates for separable parametric programs ⋮ Finite convergence of algorithms for nonlinear programs and variational inequalities ⋮ The polyadic structure of factorable function tensors with applications to high-order minimization techniques ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
This page was built for publication:
