Operations research and optimization (ORO)

DOI10.1080/02331934.2011.652810zbMath1279.65077OpenAlexW2091662640MaRDI QIDQ2841150

Mohammad Reza Ansari, Nezam Mahdavi-Amiri

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.652810

zbMATH Keywords

global convergencenonlinear least squaresexact penalty methodconstrained non-linear programmingprojected structured Hessian update

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Least squares and related methods for stochastic control systems (93E24) Methods of reduced gradient type (90C52) Methods of successive quadratic programming type (90C55)

Related Items (5)

A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares ⋮ Using a spectral scaling structured BFGS method for constrained nonlinear least squares ⋮ Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares ⋮ Partitioned quasi-Newton methods for sparse nonlinear equations ⋮ A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares

Cites Work

• Unnamed Item
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares
• Interior-point algorithms, penalty methods and equilibrium problems
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
• An analysis of reduced Hessian methods for constrained optimization
• On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
• On Generating Test Problems for Nonlinear Programming Algorithms
• Hybrid Methods for Nonlinear Least Squares
• On conditions for optimality of the nonlinearl 1 problem
• Second-order conditions for an exact penalty function
• An Adaptive Nonlinear Least-Squares Algorithm
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
• A Penalty Function Method Converging Directly to a Constrained Optimum
• Algorithms for the Solution of the Nonlinear Least-Squares Problem
• Constrained nonlinear least squares: an exact penalty approach with projected structured quasi-Newton updates
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
• On the Convergence of Successive Linear-Quadratic Programming Algorithms
• Interior Methods for Mathematical Programs with Complementarity Constraints
• An Exact Potential Method for Constrained Maxima

This page was built for publication: Operations research and optimization (ORO)