scientific article; zbMATH DE number 3307153

zbMath0193.18805MaRDI QIDQ5588268

Garth P. McCormick, Anthony V. Fiacco

Publication date: 1968

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

zbMATH Keywords

operations research

Mathematics Subject Classification ID

Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

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, A trust-region algorithm for equality-constrained optimization via a reduced dimension approach., Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization, Feasible methods for nonconvex nonsmooth problems with applications in green communications, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization, Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system, Parallelizable preprocessing method for multistage stochastic programming problems, A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems, Two differential equation systems for inequality constrained optimization, Second-order optimality conditions for constrained optimization problems with \(C^1\) data via regular and limiting subdifferentials, New simple exact penalty function for constrained minimization, An interior-point method for multifractional programs with convex constraints, On controlling the parameter in the logarithmic barrier term for convex programming problems, Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions, A stable differential equation approach for inequality constrained optimization problems, Exact barrier function methods for Lipschitz programs, Computable error bounds for an optimization problem with parallelepiped constraint, Mechanical system modelling using recurrent neural networks via quasi- Newton learning methods, A parametric procedure for ultrametric tree estimation from conditional rank order proximity data, An intelligent decision support system for assisting industrial wastewater management, Second-order sufficient conditions for control problems with mixed control-state constraints, A primal-dual interior-point method for linear programming based on a weighted barrier function, A method of Euclidean centers, A continuation method for monotone variational inequalities, Global optimization for the biaffine matrix inequality problem, Integral global minimization: Algorithms, implementations and numerical tests, An interior point algorithm for nonlinear quantile regression, An interior point method for general large-scale quadratic programming problems, Computational experience with penalty-barrier methods for nonlinear programming, The Newton modified barrier method for QP problems, On the formulation and theory of the Newton interior-point method for nonlinear programming, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming, Primal-dual methods for linear programming, On regular coderivatives in parametric equilibria with non-unique multipliers, Extra-optimal methods for solving ill-posed problems: survey of theory and examples, Global minimization of constrained problems with discontinuous penalty functions, Global optimum shape design, Decreasing the sensitivity of open-loop optimal solutions in decision making under uncertainty, A primal-dual modified log-barrier method for inequality constrained nonlinear optimization, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, On the solution of linearly constrained optimization problems by means of barrier algorithms, Cubic regularization in symmetric rank-1 quasi-Newton methods, An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces, Differential equation method based on approximate augmented Lagrangian for nonlinear programming, Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm, An active-set algorithm and a trust-region approach in constrained minimax problem, A penalized method for multivariate concave least squares with application to productivity analysis, Calmness and exact penalization in constrained scalar set-valued optimization, A stable approach to Newton's method for general mathematical programming problems in R\(^n\), A combined penalty function and gradient projection method for nonlinear programming, Solving nearly-separable quadratic optimization problems as nonsmooth equations, Second-order sufficient conditions for state-constrained optimal control problems, A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems, Minimal infeasible constraint sets in convex integer programs, Examples of ill-behaved central paths in convex optimization, Multiplier stabilization applied to two-stage stochastic programs, Sensitivity analysis for variational inequalities and nonlinear complementarity problems, Stability and sensitivity-analysis for stochastic programming, An approximate penalty method with descent for convex optimization problems, A continuation algorithm for a class of linear complementarity problems using an extrapolation technique, Mixing convex-optimization bounds for maximum-entropy sampling, A software system for multiextremal optimization, Quadratic convergence of an extrapolation method, Sensitivity and parametric bound analysis for a single pass machining problem, An interior-point method for fractional programs with convex constraints, Optimality conditions and global convergence for nonlinear semidefinite programming, Using feedback functions in linear programming problems, An objective penalty function method for biconvex programming, New constraint qualifications with second-order properties in nonlinear optimization, Sensitivity analysis in geometric programming: Theory and computations, Extending and solving a multiperiod congested network flow model, An interior point potential reduction method for constrained equations, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization, A modified Nelder-Mead barrier method for constrained optimization, On solving three classes of nonlinear programming problems via simple differentiable penalty functions, Scheduling of power generation via large-scale nonlinear optimization, Second-order optimality conditions for the extremal problem under inclusion constraints, Interval-valued kriging for geostatistical mapping with imprecise inputs, Damped inertial dynamics with vanishing Tikhonov regularization: strong asymptotic convergence towards the minimum norm solution, Optimal shape design in biomimetics based on homogenization and adaptivity, Theorems of the alternative and optimality conditions, Solution of nonlinear programming with unknown distribution function, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Synthesis of waffle plates in the post buckled domain, Iterative determination of parameters for an exact penalty function, An improved penalty function method for solving constrained parameter optimization problems, A survey of model reference adaptive techniques - theory and applications, Penalty function methods for constrained stochastic approximation, Improving complexity of structured convex optimization problems using self-concordant barriers, Analyticity of the central path at the boundary point in semidefinite programming, Second order optimality conditions and their role in PDE control, An exterior point polynomial-time algorithm for convex quadratic programming, Several filled functions with mitigators., Inertia-controlling factorizations for optimization algorithms, Primal-dual Newton-type interior-point method for topology optimization, First- and second-order necessary conditions via exact penalty functions, An interior method for nonconvex semidefinite programs, A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems, A hadamard-stable extension of courant's sequential method for convex extremal problems, Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs, Distribution sensitivity analysis for stochastic programs with complete recourse, Strict quasi-concavity and the differential barrier property of gauges in linear programming, Two differential equation systems for equality-constrained optimization, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, The development of a changing range genetic algorithm, Perturbed variations of penalty function methods. Example: Projective SUMT, The principle of virtual work and its dual for contact problems, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, A numerical method for interface reconstruction of triple points within a volume tracking algorithm, Exactness and algorithm of an objective penalty function, Convergence of a class of penalty methods for constrained scalar set-valued optimization, Applications of one-shot methods in PDEs constrained shape optimization, Combining fast inertial dynamics for convex optimization with Tikhonov regularization, Stability of the solution of definite quadratic programs, An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation, A comparison of optimization solvers for log binomial regression including conic programming, Karmarkar's projective method for linear programming: a computational survey, A function approximation approach for parametric optimization, An exact penalty function method with global convergence properties for nonlinear programming problems, Shape Optimization for Free Boundary Problems – Analysis and Numerics, A novel approach for solving multi-parametric problems with nonlinear constraints, Some NP-complete problems in quadratic and nonlinear programming, Inverse analyses in fracture mechanics, The method of quasi-solutions based on barrier functions in the analysis of improper convex programs, A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems, A multiplier active-set trust-region algorithm for solving constrained optimization problem, A directed genetic algorithm for global optimization, Continuous limits for constrained ensemble Kalman filter, Estimates for Kuhn-Tucker points of perturbed convex programs, A new penalty method for nonlinear programming, Unnamed Item, Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming, Breast tumor susceptibility to chemotherapy via support vector machines, Minimum problems on differentiable manifolds, Interior Point Methods for Nonlinear Optimization, Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, Portfolio optimization with linear and fixed transaction costs, A solution differentiability result for evolutionary quasi-variational inequalities, Hölder continuity of solutions to elastic traffic network models, Nonconvex optimization using negative curvature within a modified linesearch, New self-concordant barrier for the hypercube, A hybrid optimization technique coupling an evolutionary and a local search algorithm, Parameter estimation in multiple linear regression with fuzzy inequality constraints, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, An interior-point algorithm for elastoplasticity, Acceleration of the leastpth algorithm for minimax optimization with engineering applications, Application of the interior‐point method to shakedown analysis of pavements, Robust game theory, An augmented Lagrangian approach to material discontinuities in meshless methods, Complexity of some inverse shortest path lengths problems, A variable structure convex programming based control approach for a class of uncertain linear systems, A new fractional Chebyshev FDM: an application for solving the fractional differential equations generated by optimisation problem, A class of augmented filled functions, Augmented Lagrangian Objective Penalty Function, CONVERGENCE RATE OF THE SUCCESSIVE ZOOMING GENETIC ALGORITHM FOR BAND-WIDTHS OF EQUALITY CONSTRAINT, Convergence rate for regularized arrier function methods, A nonlinear Lagrangian for constrained optimization problems, Integral global minimization of constrained problems with discontinuous penalty functions, Dual approach to the application of barrier functions for the optimal correction of improper linear programming problems of the first kind, Reconstruction of symmetric models composed of analytic curves and surfaces from point cloud, Lagrange multipliers and nonlinear programming, Solution theorems in probabilistic programming: A linear programming approach, On strong and weak second-order necessary optimality conditions for nonlinear programming, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, Penalty methods for mathematical programming in \(E^n\) with general constraint sets, Convergente rate of a penalty-function scheme, The potential method for conditional maxima in the locally compact metric spaces, On penalty function methods for nonlinear programming problems, Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, Balance function for the optimal control problem, Use of the augmented penalty function in mathematical programming problems. I: Ordinary gradient algorithm, Lipschitz modulus in convex semi-infinite optimizationviad.c. functions, Decomposition in separable geometric programming, Use of the augmented penalty function in mathematical programming problems. I, An acceptance region theory for chance-constrained programming, On the method of multipliers for mathematical programming problems, A diverse strategy method of minimization, The likelihood function of additive learning models: sufficient conditions for strict log-concavity and uniqueness of maximum, A new approach to constrained function optimization, A nonlinear programming approach to space shuttle trajectory optimization, Convergence properties of local solutions of sequences of mathematical programming problems in general spaces, Über eine Penalty-Methode, New approach to comparison of search methods used in nonlinear programming problems, Upper bounds to plastic strains in shake-down of structures subjected to cyclic loads, Restricted \(M\)-estimation, A modified Newton method for constrained estimation in covariance structure analysis, Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions, Marginal values and second-order necessary conditions for optimality, The decomposition optimization of complex systems, Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method, An Elimination Type Two-Stage Procedure for Selecting the Population with the Largest Mean fromkLogistic Populations, On uniqueness of Kuhn-Tucker multipliers in nonlinear programming, A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation†, Global convergence and rate of convergence of a method of centers, Derivation of duality in mathematical programming and optimization theory, An approximate strong KKT condition for multiobjective optimization, Rank-one techniques in log-barrier function methods for linear programming, Global convergence in infeasible-interior-point algorithms, Extensions of the potential reduction algorithm for linear programming, Integral global optimization method for solution of nonlinear complementarity problems, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming, Limiting behavior of weighted central paths in linear programming, Interactive decision making: Equivalence of modified formulations, Some properties of the Hessian of the logarithmic barrier function, Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints, A penalty method with trust-region mechanism for nonlinear bilevel optimization problem, Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Apart sets and functions: an application to the stability of penalized optimization problems, Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization, How to deal with the unbounded in optimization: Theory and algorithms, Interior-point methods: An old and new approach to nonlinear programming, Modified primal path-following scheme for the monotone variational inequality problem, Inverse barriers and CES-functions in linear programming, Discontinuous piecewise linear optimization, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, Guided dive for the spatial branch-and-bound, Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization, Automatic decrease of the penalty parameter in exact penalty function methods, A smooth penalty function algorithm for network-structured problems, An application of mathematical programming to sample allocation, A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem., A practical optimality condition without constraint qualifications for nonlinear programming, On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints, Constrained inverse formulations in random material design., The barrier attribute of filled functions., Single-period Markowitz portfolio selection, performance gauging, and duality: a variation on the Luenberger shortage function, Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization, Direct limit analysis via rigid-plastic finite elements, Sufficient conditions for the uniqueness of parameter estimates from binary-response data, A finite element formulation for shakedown problems using a yield criterion of the mean, A modified Newton method for minimization, Approximation methods for the unconstrained optimization, Penalty function theory for general convex programming problems, A gradient projection-multiplier method for nonlinear programming, Estimation of parameters for the Grice theory of simple reaction time, Using sliding modes in static optimization and nonlinear programming, Unified approach to unconstrained minimization via basic matrix factorizations, A stable interior penalty method for convex extremal problems, An exponential penalty method for nondifferentiable minimax problems with general constraints, Estimation of cell kinetic parameters from flow microfluorometry, On the convergence rate for a penalty function method of exponential type, Design sensitivity analysis of elastic mechanical systems, Some numerical methods for limit analysis in continuum mechanics, An algorithm for minimizing a differentiable function subject to box constraints and errors, Some remarks on the symmetric rank-one update, Nonlinear programming solutions for controlling the vibration pattern of stretched strings, The structure of admissible points with respect to cone dominance, Respecifying the weighting matrix of a quadratic objective function, A geometric method in nonlinear programming, A class of programming problems whose objective function contains a norm, On optimal regulation of a storage level with application to the water level regulation of a lake, Uniqueness of solution in linear programming, Condizioni necessarie e sufficienti per un problema di programmazione non lineare, System order reduction using the induced operator norm and its applications to linear regulators, A Newton-type curvilinear search method for constrained optimization, A unified approach to structural weight minimization, An exact penalty function algorithm for solving general constrained parameter optimization problems, A weighted least squares study of robustness in interior point linear programming, A globally convergent SQP method for semi-infinite nonlinear optimization, Proximal methods in view of interior-point strategies, Implied constraints and an alternate unified development of nonlinear programming theory, Analytic efficient solution set for multi-criteria quadratic programs, Quadratically constrained convex quadratic programmes: Faculty feasible regions, A new penalty function algorithm for convex quadratic programming, Yield design theory: An efficient static method formulation, Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics, A simulation-based approach to two-stage stochastic programming with recourse, Minimal representation of convex regions defined by analytic functions, Advances in trust region algorithms for constrained optimization, Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach, On infeasibility of systems of convex analytic inequalities, Infeasibility analysis for systems of quadratic convex inequalities, Convex constrained programmes with unattained infima, Symbiosis between linear algebra and optimization, Interior-point methods, The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors, Pivot versus interior point methods: Pros and cons, Degeneracy in NLP and the development of results motivated by its presence, A primal-dual infeasible-interior-point algorithm for linear programming, A simple constraint qualification in convex programming, K-K-T multiplier estimates and objective function lower bounds from projective SUMT, Using copositivity for global optimality criteria in concave quadratic programming problems, Implied constraints and a unified theory of duality in linear and nonlinear programming, The principle and models of dynamic programming, Bundle trust-region algorithm for bilinear bilevel programming, Conditions for the uniqueness of the optimal solution in linear semi- infinite programming, On the classical logarithmic barrier function method for a class of smooth convex programming problems, Deriving an unconstrained convex program for linear programming, Characterizations of strict local minima and necessary conditions for weak sharp minima, Nonlinear complementarity as unconstrained and constrained minimization, Two numerical methods for optimizing matrix stability, Lipschitz properties of solutions in mathematical programming, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Sensitivity analysis in economics, Perturbed solutions of variational inequality problems over polyhedral sets, Sensitivity analysis in posynomial geometric programming, On the exactness of a class of nondifferentiable penalty functions, Polynomial approximation technique for dynamic optimization problems, Penalty functions, Newton's method, and quadratic programming, New results on a class of exact augmented Lagrangians, Sensitivity analysis for non-linear programs with linear constraints, Parallel algorithms for nonlinear programming problems, A theoretical approximation scheme for Stackelberg problems, Second-order sensitivity analysis in factorable programming: Theory and applications, Parameter-dependent transitions and the optimal control of dynamical diseases, Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton, On regular minimax optimization, ODE versus SQP methods for constrained optimization, Recent developments in constrained optimization, Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data, Image space approach to penalty methods, A new continuation method for complementarity problems with uniform P- functions, Nonlinear least-absolute-values and minimax model fitting, Interior path following primal-dual algorithms. I: Linear programming, Derivative evaluation and computational experience with large bilevel mathematical programs, Solving a class of LP problems with a primal-dual logarithmic barrier method, An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints, Pseudo-duality and saddle points, A property of certain multistage linear programs and some applications, A class of generalized variable penalty methods for nonlinear programming, A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms, Selected applications of all-quadratic programming, Duality for nonlinear multiple-criteria optimization problems, Optimal control of a rotary crane, Lexocographic multipliers, Distributed-parameter optimal control via mathematical programming, A class of differential descent methods for constrained optimization, A cutting-plane algorithm with linear and geometric rates of convergence, Variable penalty methods for constrained minimization, Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle, A globally convergent algorithm for exact penalty functions, Best approximation with prescribed norm, Sensitivity analysis in geometric programming, The solution and sensitivity of a general optimal control problem, Higher-order necessary conditions for infinite and semi-infinite optimization, A modified Newton's method for minimizing factorable functions, A penalty treatment of equality constraints in generalized geometric programming, A review of the optimal power flow, Interior penalty methods for finite element approximations of the Signorini problem in elastostatics, Constrained optimization along geodesics, Dimensional synthesis of four bar linkage for function generation with velocity and acceleration constraints, Strong uniqueness and second order convergence in nonlinear discrete approximation, An improved variable penalty algorithm for automated structural design, Global optimization by controlled random search, A comparative performance evaluation of 27 nonlinear programming codes, System identification for yield limits and hardening moduli in discrete elastic-plastic structures by nonlinear programming, A network penalty method, The diagonalizability of quadratic functions and the arbitrariness of shadow prices, SQVAM: A variance minimizing algorithm, Hierarchical optimization: An introduction, Modified barrier functions (theory and methods), Solving some optimal control problems using the barrier penalty function method, Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization, A homotopy approach for stabilizing single-input systems with control structure constraints, Projection algorithms for linear programming, Optimization with neural networks: A recipe for improving convergence and solution quality, Calculation of bounds on variables satisfying nonlinear inequality constraints, Evaluation of optimization methods for machining economics models, A variational technique for the computation of the vibration frequencies of mechanical systems governed by nonsymmetric matrices, A method of multipliers for mathematical programming problems with equality and inequality constraints, A new technique to optimize the functions of fuzzy profit of queuing models: application to a queuing model with publicity and renouncement, Optimal control of nonlinear discrete time systems by mathematical programming, A generalized Lagrangian function and multiplier method, Algorithm model for penalty functions-type iterative pcedures, Rates of convergence for a method of centers algorithm, Globalization strategies for mesh adaptive direct search, Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians, Second- and higher-order duality in nonlinear programming, Learning models for a continuum of sensory states reexamined, On the rate of convergence of some feasible direction algorithms, On the Pironneau-Polak method of centers, Multiplier methods: A survey, An interval estimate for making statistical inferences about true scores, An accelerated multiplier method for nonlinear programming, Optimum design of stiffened structures with constraint on the frequency in the presence of initial stresses, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function, A dual iterative substructuring method with a penalty term, Use of prior information in the consistent estimation of regression coefficients in measurement error models, A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results, Improving directions of negative curvature in an efficient manner, A global continuation algorithm for solving binary quadratic programming problems, Sensitivity analysis of the combined travel demand model with applications, A hybrid variable penalty method for nonlinear programming, On conditions for optimality of a class of nondifferentiable functions, A class of superlinearly convergent projection algorithms with relaxed stepsizes, An exact penalty method for solving optimal control problems, Perturbation theory for mathematical programming problems, A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\), Spline and weighted random directions method for nonlinear optimization, The polyadic structure of factorable function tensors with applications to high-order minimization techniques, A globally convergent algorithm for nonlinearly constrained optimization problems, Nonlinear programming via an exact penalty function: Asymptotic analysis, A SIMPLE METHOD FOR OPTIMIZATION, Linear programming with entropic perturbation, On Variable-Metric Methods for Sparse Hessians, Linear programming by minimizing distances, Decentralized multi-agent optimization based on a penalty method, A general non-linear optimization algorithm for lower bound limit analysis, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, ON THE RELATION BETWEEN TWO APPROACHES TO EXTERIOR PENALTY METHOD FOR CONSTRAINED OPTIMAL CONTROL PROBLEMS, Numerical Conformal Mapping, Second-order conditions in c^{1, 1}optimization with applications, Hybrid differential evolutionary strawberry algorithm for real-parameter optimization problems, An unconstrained convex programming view of linear programming, Estimation of variable regression parameters as a two-criterion problem, Discontinuous optimization in a class of multi-stage production systems, Tracking approach in hierarchical optimization of large-scale systems, Fluorescence molecular imaging based on the adjoint radiative transport equation, An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games, An example of an ill-conditioned nlp problem, Recent advances in unconstrained optimization, Global Dynamical Solvers for Nonlinear Programming Problems, Generalized second-order derivatives and optimality conditions, Unnamed Item, Incorporating knowledge on the measurement noise in electrical impedance tomography, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, Explicit solution of an optimization problem, A language for nonlinear programming problems, An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions, An efficient algorithm for minimizing barrier and penalty functions, Generalized Sensitivity Analysis of Nonlinear Programs, Implicit function theorems for mathematical programming and for systems of inequalities, Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms, Newton-type methods for unconstrained and linearly constrained optimization, Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme, Quasidifferntiability of optimal solutions in parametric optimal solutions in parametric nonlinear optimization, Projection methods for non-linear programming, Comparison principles applied to obstacle problems with penalties, Impproving the rate of convergence of the logarithmic barrier function method, Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs, The use of interior penalty functions to overcome lognormal distribution parameter estimation anomalies, Necessary and sufficient conditions for a penalty method to be exact, Convergence bounds for nonlinear programming algorithms, A superlinearly convergent algorithm for minimization without evaluating derivatives, Optimally conditioned optimization algorithms without line searches, Optimization-based approach to path planning for closed chain robot systems, Linear programming twin support vector regression, Continuous relaxations for Constrained Maximum-Entropy Sampling, Extremization of functions with equality constraints, Computing Maximum Likelihood Estimators of Convex Density Functions, Moving truncations barrier-function methos for estimation in three-parameter lognormal models, On global quadratic growth condition for min-max optimization problems with quadratic functions, Non-linear programming using least pth optimization with extrapolation†, The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming, Sensitivity analysis for nonlinear programming using penalty methods, A numerical study of multiplier methods for constrained parameter optimization, Contributions to the theory of stochastic programming, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Computable error bounds for nonlinear programming, Optimization of electrical circuits, A modification of Armijo's step-size rule for negative curvature, Exact penalty functions in nonlinear programming, Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming, Computation of the distance to semi-algebraic sets, Nonlinear leastpth optimization and nonlinear programming, On optimality conditions in nondifferentiable programming, Unnamed Item, First and second order conditions for a class of nondifferentiable optimization problems, A two parameter mixed interior-exterior penalty algorithm, Second-order conditions for an exact penalty function, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, Lipschitz programming via increasing convex-along-rays functions^*, Shadow prices in nonconvex mathematical programming, Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems, On the use of directions of negative curvature in a modified newton method, A lower bound for the controlling parameters of the exact penalty functions, A first order, exact penalty function algorithm for equality constrained optimization problems, First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems, An interior point method for nonlinear programming, Invex functions and constrained local minima, Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems, Some remarks on condensation methods for geometric programs, Optimization of large-scale complex systems, Extending the Pennisi--McCormick Second-Order Sufficiency Theory for Nonlinear Programming to Infinite Dimensions, Entropy binomial tree method and calibration for the volatility smile, Inaccurate linear equation system with a restricted-rank error matrix, A Quasi-Newton Method with No Derivatives, Necessary and sufficient conditions for quadratic minimality, On local convergence of an algorithm for optimal control, Penalty functions in ε-programming and ε-minimax problems, A simulated annealing approach for optimization of multi-pass turning operations, A numerical study of multiplier methods for constrained parameter optimization, On the symmetric affiine scaling algorithm for line programming^*, Sensitivity analysis for constraint and variational systems by means of set-valued differentiation, A dual approach to solving nonlinear programming problems by unconstrained optimization, MONOPOLISTIC EOUILIBRIUM, COMPROMISE BENEFIT AND THE THEORY OF THE SECOND BEST(*), Computational experience in sensitivity analysis for nonlinear programming, On the convergence of SUMT, On the Sensitivity of Least Squares Data Fitting by Nonnegative Second Divided Differences, A column generation algorithm for nonlinear programming, A dual differentiable exact penalty function, Exact penalty functions in nonlinear programming, Probability maximization via Minkowski functionals: convex representations and tractable resolution, On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems, A Note on the McCormick Second-Order Constraint Qualification, A new perspective on parameter study of optimization problems, Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization, Convergence rate estimates for penalty methods revisited, Matrix Balancing Based Interior Point Methods for Point Set Matching Problems, Optimality conditions for nonlinear second-order cone programming and symmetric cone programming, Estimation and inference by stochastic optimization, Minimizing sequences in a constrained DC optimization problem, An efficient one—dimensional search procedure for barrier functions, Relative efficiency of computing optimal growth by conjugate gradient and Davidon methods, A quadratically-convergent algorithm for general nonlinear programming problems, Unnamed Item, Unnamed Item, New smoothing techniques for solving bang–bang optimal control problems—numerical results and statistical interpretation, Using logarithmic penalties in the shooting algorithm for optimal control problems, An interior point algorithm for convex quadratic programming with strict equilibrium constraints, An easy way to teach interior-point methods., An optimization method designed to improve 3-D vehicle comfort and road holding capability through the use of active and semi-active suspensions, Computational optimization of the vortex manufacturing of advanced materials, Nonlinear programming on a microcomputer, Local behavior of the Newton method on two equivalent systems from linear programming, Linearization method for the discrete minimax problem, Linearization method for the discrete minimax problem, Complexity and performance of an Augmented Lagrangian algorithm, Slater Condition for Tangent Derivatives