scientific article; zbMATH DE number 3307153
From MaRDI portal
Publication:5588268
zbMath0193.18805MaRDI QIDQ5588268
Garth P. McCormick, Anthony V. Fiacco
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
Differential systems for constrained optimization via a nonlinear augmented Lagrangian ⋮ A local convergence analysis of bilevel decomposition algorithms ⋮ Asymptotics of the regression quantile basic solution under misspecification. ⋮ On the numerical solution of Plateau's problem ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ Calmness and exact penalization in vector optimization with cone constraints ⋮ A logarithmic barrier approach for linear programming ⋮ An interior-point penalty active-set trust-region algorithm ⋮ Neural approach for solving several types of optimization problems ⋮ Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints ⋮ On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ A dual iterative substructuring method with a penalty term in three dimensions ⋮ Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ Second-order optimality conditions for mathematical programs with equilibrium constraints ⋮ ODE methods for optimization with equality constraints ⋮ The double-step Newton method for polynomials with all real zeros ⋮ Convergence analysis of a differential equation approach for solving nonlinear programming problems ⋮ Improving machine dynamics via geometry optimization ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ Optimization problem coupled with differential equations: a numerical algorithm mixing an Interior-point method and event detection ⋮ A dynamic optimization problem related to organic aerosols ⋮ Stability of differential inclusions: a computational approach ⋮ Estimation of the sojourn time of a weakly perturbed Lagrangian system in a given region ⋮ A class of volumetric barrier decomposition algorithms for stochastic quadratic programming ⋮ Feedback stabilization methods for the solution of nonlinear programming problems ⋮ \(L^{p}\)-norms, log-barriers and Cramer transform in optimization ⋮ Implications of the constant rank constraint qualification ⋮ Limited-memory BFGS systems with diagonal updates ⋮ A new exact exponential penalty function method and nonconvex mathematical programming ⋮ A primal-dual augmented Lagrangian ⋮ A probabilistic analysis of the multiknapsack value function ⋮ Interior point methods 25 years later ⋮ A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization ⋮ Active constraints, indefinite quadratic test problems, and complexity ⋮ Wavelet-based boundary element methods for exterior electromagnetic shaping ⋮ Schemes of involving dual variables in inverse barrier functions for problems of linear and convex programming ⋮ Approximation and regularization properties of augmented penalty functions in convex programming ⋮ A Bayesian approach for quantile and response probability estimation with applications to reliability ⋮ The modified barrier function method for linear programming and its extensions ⋮ Calmness and exact penalization in vector optimization under nonlinear perturbations ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ Penalty function methods and a duality gap for invex optimization problems ⋮ Necessary optimality conditions for bilevel minimization problems ⋮ Slopes of shadow prices and Lagrange multipliers ⋮ Generalized semi-infinite programming: a tutorial ⋮ Numerical method for a dynamic optimization problem arising in the modeling of a population of aerosol particles ⋮ Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem ⋮ Study of a primal-dual algorithm for equality constrained minimization ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ Interior penalty functions and duality in linear programming ⋮ A derivative-free nonmonotone line-search technique for unconstrained optimization ⋮ Primal-dual active-set methods for large-scale optimization ⋮ Generalized semi-infinite programming: The symmetric reduction ansatz ⋮ Ragnar Frisch and interior-point methods ⋮ A method for construction of stability regions by Lyapunov functions ⋮ A local convergence property of primal-dual methods for nonlinear programming ⋮ George B. Dantzig and systems optimization ⋮ An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods ⋮ Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts ⋮ A new fictitious domain method in shape optimization ⋮ Exterior point algorithms for nearest points and convex quadratic programs ⋮ Existence and uniqueness of relative incidence estimates in case-series analysis ⋮ On the convergence of the exponential multiplier method for convex programming ⋮ A long-step barrier method for convex quadratic programming ⋮ Robinson's implicit function theorem and its extensions ⋮ Local path-following property of inexact interior methods in nonlinear programming ⋮ Approximate greatest descent methods for optimization with equality constraints ⋮ Nonlinear output constraints handling for production optimization of oil reservoirs ⋮ Primal-dual interior-point method for thermodynamic gas-particle partitioning ⋮ Optimization of a shock-wave system ⋮ Complementary energy approach to contact problems based on consistent augmented Lagrangian formulation ⋮ Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds ⋮ On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming ⋮ Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming. ⋮ A Newton method for linear programming ⋮ Barrier function based model predictive control ⋮ Modeling microbial abundances and dysbiosis with beta-binomial regression ⋮ High-order Newton-penalty algorithms ⋮ A curvilinear method based on minimal-memory BFGS updates ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming ⋮ One modification of the logarithmic barrier function method in linear and convex programming ⋮ Barrier function method and correction algorithms for improper convex programming problems ⋮ Second-order and related extremality conditions in nonlinear programming ⋮ Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm ⋮ Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model ⋮ On-line identification of distributed parameter systems ⋮ On the differentiability of optimal values for bounded nonlinear programs with equality constraints ⋮ Sensitivity analysis for variational inequalities ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ A unified view of interior point methods for linear programming ⋮ The relation between the path of centers and Smale's regularization of the linear programming problem ⋮ Perturbations of extremal problems with constraints and necessary optimality conditions ⋮ Solution differentiability for variational inequalities ⋮ A nonlinear programming approach to the parameter design problem ⋮ Convexity properties of inverse problems with variational constraints ⋮ An \(O(n^ 3L)\) potential reduction algorithm for linear programming ⋮ Unconstrained global optimization using strict complementary slackness ⋮ Optimization with unary functions
This page was built for publication: