On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions

No abstract is available for this paper.

• Publication year

  1986

• Venue

  Ima Journal of Numerical Analysis

• Publication date

  1986-07-01

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1093/IMANUM/6.3.357
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms

  1984cited by this paper
• A smooth sequential penalty function method for solving nonlinear programming problems

  1984cited by this paper
• A new linesearch algorithm for nonlinear least squares problems

  1984cited by this paper
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear

  1983cited by this paper
• On the unconstrained optimization of partially separable functions

  1982cited by this paper
• Practical Methods of Optimization. Vol. 2 — Constrained Optimization

  1982cited by this paper
• Strongly Regular Generalized Equations

  1980cited by this paper
• Test examples for nonlinear programming codes

  1980cited by this paper
• A fast algorithm for nonlinearly constrained optimization calculations

  1978cited by this paper
• Projected Lagrangian Methods Based on the Trajectories of Penalty and Barrier Functions.

  1978cited by this paper
• Numerical methods for nonlinearly constrained optimization

  1976cited by this paper
• Efficient Linear Search Algorithms for the Logarithmic Barrier Function

  1976cited by this paper
• Factorizing symmetric indefinite matrices

  1976cited by this paper
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems

  1976cited by this paper
• Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions

  1971cited by this paper
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations

  1971cited by this paper
• The potential method for conditional maxima in the locally compact metric spaces

  1970cited by this paper
• Nonlinear Programming—Sequential Unconstrained Minimization Techniques

  1969cited by this paper
• Determination of the inertia of a partitioned Hermitian matrix

  1968cited by this paper

• An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

  2021cites this paper
• CME 338 Large-Scale Numerical Optimization Instructor :

  2019cites this paper
• Classic and Modified Log-Barrier Methods Algorithms

  2019cites this paper
• VIPER: Volume Invariant Position-based Elastic Rods

  2019cites this paper
• VIPER: Volume Invariant Position-based Elastic Rods

  2019cites this paper
• Geometric modeling with primitives

  2019cites this paper
• VIPER: Volume Invariant Position-based Elastic Rods

  2019cites this paper
• A regularization method for constrained nonlinear least squares

  2019cites this paper
• Numerical Optimization

  2018cites this paper
• Détection de la non-réalisabilité et stratégies de régularisation en optimisation non linéaire

  2018influential citation
• Penalty and Augmented Lagrangian Methods

  2017cites this paper
• Realtime Face Tracking and Animation

  2015cites this paper
• Multivariate analysis of Raman spectroscopy data

  2015cites this paper
• Méthodes primales-duales régularisées pour l'optimisation non linéaire avec contraintes

  2014influential citation
• A regularized interior-point method for constrained linear least squares

  2013cites this paper
• Namur On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple

  2013influential citation
• Solving Limited-Memory BFGS Systems with Generalized Diagonal Updates

  2012cites this paper
• A study of optimization and optimal control computation : exact penalty function approach

  2012cites this paper
• Sequential Quadratic Programming Methods

  2012cites this paper
• Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods

  2012cites this paper
• A primal-dual augmented Lagrangian

  2012influential citation
• Study of a primal-dual algorithm for equality constrained minimization

  2011cites this paper
• Active-Set Methods for Quadratic Programming

  2011cites this paper
• Preconditioning Saddle-Point Systems with Applications in Optimization

  2010cites this paper
• On the Boundedness of Penalty Parameters in an Augmented Lagrangian Method with Constrained Subproblems ∗

  2010cites this paper
• Improved convergence order for augmented penalty algorithms

  2009cites this paper
• Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks

  2009cites this paper
• An 1 Elastic Interior-Point Method for Mathematical Programs with Complementarity Constraints

  2009influential citation
• Techniques for solving Nonlinear Programming Problems with Emphasis on Interior Point Methods and Optimal Control Problems

  2008cites this paper
• Iterative Solution of Augmented Systems Arising in Interior Methods

  2007influential citation
• Using constraint preconditioners with regularized saddle-point problems

  2007cites this paper
• Huber approximation for the non-linear l

  2006cites this paper
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update

  2006cites this paper
• A New Penalty Method for Nonlinear Programming

  2006cites this paper
• The University of Reading Department of Mathematics Using Constraint Preconditioners with Regularized Saddle-Point Problems

  2006cites this paper
• Detecting, locating and sizing leaks in gas-filled pipes using acoustical measurements

  2006cites this paper
• Huber approximation for the non-linear ‘ 1 problem

  2005influential citation
• Numerical methods for large-scale nonlinear optimization

  2005influential citation
• A primal-dual trust region algorithm for nonlinear optimization

  2004cites this paper
• A new semi-penalty method for nonlinear programming

  2004cites this paper
• Huber Approximation for the Nonlinear 1 Problem

  2004influential citation
• Some Reflections on the Current State of Active-Set and Interior-Point Methods for Constrained Op

  2003cites this paper
• Properties of the Log-Barrier Function on

  2002cites this paper
• Interior Methods for Nonlinear Optimization

  2002cites this paper
• A New Trust-Region Algorithm for Equality Constrained Optimization

  2002cites this paper
• Properties of the Log-Barrier Function on Degenerate Nonlinear Programs

  2002cites this paper
• Inertia-controlling factorizations for optimization algorithms

  2002cites this paper
• On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm

  2001cites this paper
• Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming

  2001cites this paper
• A Quasi-Newton Quadratic Penalty Method for Minimization Subject to Nonlinear Equality Constraints

  2000cites this paper
• Iterative methods for ill-conditioned linear systems from optimization

  2000cites this paper
• Numerical Experiments with Methods for Solving the KKT Equations

  1999cites this paper
• On the Convergence of Huber Approximation for the Nonlinear ` 1 Problem

  1999influential citation
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming

  1998influential citation
• New Theoretical Results on Recursive Quadratic Programming Algorithms

  1998cites this paper
• Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming

  1998cites this paper
• M ´ ETODOS COMPUTACIONAIS DE OTIMIZAC ¸ ˜ AO

  1998cites this paper
• Some New Theoretical Results on RecursiveQuadratic Programming Algorithms 1

  1998influential citation
• The Gauss-Newton DirectioninSemide nite ProgrammingSerge Kruk

  1998cites this paper
• Modifying the inertia of matrices arising in optimization

  1998cites this paper
• On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds

  1997cites this paper
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

  1997cites this paper
• Stable computation of search directions for near-degenerate linear programming problems

  1997cites this paper
• Quadratic rate of convergence for a primal-dual exponential penalty algorithm

  1997cites this paper
• Methods for nonlinear constraints in optimization calculations

  1996cites this paper
• Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization

  1995cites this paper
• Maximizing pseudoconvex transportation problem: a special type

  1995influential citation
• Maximizing pseudoconvex transportation problem: a

  1995cites this paper
• A two parameter mixed interior-exterior penalty algorithm

  1995cites this paper
• Complete Orthogonal Decomposition for Weighted Least Squares

  1995cites this paper
• Stable exponential-penalty algorithm with superlinear convergence

  1994cites this paper
• A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization

  1994cites this paper
• Algorithms for General Constrained Nonlinear Optimization

  1994cites this paper
• Large-scale SQP methods and their application in trajectory optimization

  1994cites this paper
• Preconditioners for Indefinite Systems Arising in Optimization

  1992cites this paper
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients

  1991cites this paper
• Partitioning and QR factorization to avoid numerical ill-conditioning of penalty functions for constrained nonlinear programming and control

  1990cites this paper
• Computing a Trust Region Step for a Penalty Function

  1990cites this paper
• Chapter III Constrained nonlinear programming

  1989cites this paper
• On solving three classes of nonlinear programming problems via simple differentiable penalty functions

  1988cites this paper
• Mathematical Programming Manuscript No

  year unknowncites this paper
• MS & E 318 ( CME 338 ) Large-Scale Numerical Optimization

  year unknowncites this paper
• Nonlinear Constraints 3.1. Equality Constraints

  year unknowninfluential citation