Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
From MaRDI portal
Publication:597172
DOI10.1023/B:JOTA.0000005447.36961.29zbMath1055.90070OpenAlexW2085091825MaRDI QIDQ597172
Publication date: 6 August 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000005447.36961.29
strict complementarityquasi-Newton methodssuperlinear convergencefeasible algorithmsConstrained optimizationSC\(^1\) functions
Related Items
Feasible methods for nonconvex nonsmooth problems with applications in green communications, An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems, An infeasible active-set QP-free algorithm for general nonlinear programming
Cites Work
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- A QP-free constrained Newton-type method for variational inequality problems
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Minimization of \(SC^ 1\) functions and the Maratos effect
- A nonsmooth version of Newton's method
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- Nonsmooth Equations: Motivation and Algorithms
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- New Results on a Continuously Differentiable Exact Penalty Function
- Semismooth and Semiconvex Functions in Constrained Optimization
- On the Accurate Identification of Active Constraints
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
