A special newton-type optimization method
From MaRDI portal
Publication:4327920
DOI10.1080/02331939208843795zbMath0814.65063MaRDI QIDQ4327920
Publication date: 27 March 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843795
Newton's method; quadratic convergence; nonlinear programming; inequality constraints; Kuhn-Tucker conditions; Clarke's Jacobian; strict complementary slackness condition
Related Items
Elastoplastic analysis of structures under uncertainty: model and solution methods1, Global method for monotone variational inequality probelms on polyhedral sets, Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities, A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities, On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints, On a semismooth least squares formulation of complementarity problems with gap reduction, Inexact semismooth Newton methods for large-scale complementarity problems, PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION, Local properties of solutions of nonsmooth variational solutions of nonsmooth variational inequalities, A new strategy for solving variational inequalities in bounded polytopes∗, A continuation method for solving convex programming problemsviafischer reformulation, Mean Value Theorems for the Scalar Derivative and Applications, ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION, A nonmonotone semismooth inexact Newton method, Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems, Newton method of solving Karush-Kuhn-Tucker systems for a constrained Minimax Problem, A Finite Algorithm for Almost Linear Complementarity Problems, Solving nonlinear complementarity problems with neural networks: A reformulation method approach, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming, A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems, A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs, Globally convergent inexact generalized Newton's methods for nonsmooth equations, Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems., Hybrid Newton-type method for a class of semismooth equations, A new smoothing quasi-Newton method for nonlinear complementarity problems, A globally convergent semi-smooth Newton method for control-state constrained DAE optimal control problems, Parallel two-grid semismooth Newton-Krylov-Schwarz method for nonlinear complementarity problems, Exact penalties for variational inequalities with applications to nonlinear complementarity problems, Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem, Convergence of a continuous approach for zero-one programming problems, An iterative method for solving semismooth equations, Smoothing functions and smoothing Newton method for complementarity and variational inequality problems, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function, Some structural properties of a Newton-type method for semidefinite programs, Piecewise linear NCP function for QP free feasible method, Two classes of merit functions for the second-order cone complementarity problem, The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem, A derivative-free filter algorithm for nonlinear complementarity problem, A new filter method for solving nonlinear complementarity problems, Doubly uncertain transportation network: degradable capacity and stochastic demand, A smoothing QP-free infeasible method for nonlinear inequality constrained optimization, A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs, Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization, Superlinearly convergent affine scaling interior trust-region method for linear constrained \(LC^{1}\) minimization, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, Solving models with inequalities using standard econometric software, A smoothing Levenberg-Marquardt method for the extended linear complementarity problem, New approach for the nonlinear programming with transient stability constraints arising from power systems, A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems, A self-adaptive trust region method for the extended linear complementarity problems, A family of NCP functions and a descent method for the nonlinear complementarity problem, A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property, A nonsmooth Newton's method for control-state constrained optimal control problems, Feasible semismooth Newton method for a class of stochastic linear complementarity problems, A regularization smoothing Newton method for solving nonlinear complementarity problem, On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem, A smoothing conic trust region filter method for the nonlinear complementarity problem, Globally convergent Jacobian smoothing inexact Newton methods for NCP, A global continuation algorithm for solving binary quadratic programming problems, A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones, Inexact non-interior continuation method for solving large-scale monotone SDCP, New constrained optimization reformulation of complementarity problems, Derivative-free methods for monotone variational inequality and complementarity problems, Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities, An unconstrained optimization technique for large-scale linearly constrained convex minimization problems, Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Solution of monotone complementarity problems with locally Lipschitzian functions, Error bounds in mathematical programming, New NCP-functions and their properties, Global method for monotone variational inequality problems with inequality constraints, A new approach to continuation methods for complementarity problems with uniform \(P\)-functions, Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity., Complementarity problems in GAMS and the PATH solver, A cell-based dynamic traffic assignment model: Formulation and properties, The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem, A Jacobian smoothing method for box constrained variational inequality problems, Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions, On finite termination of an iterative method for linear complementarity problems, On the resolution of monotone complementarity problems, Global Newton-type methods and semismooth reformulations for NCP, An application of anisotropic regularization to the existence of weak Pareto minimal points, Inexact Newton methods for solving nonsmooth equations, A Newton-type method for positive-semidefinite linear complementarity problems, Nonlinear complementarity as unconstrained optimization, Nonlinear boundary equation approach for inequality 2-D elastodynamics, A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions, A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems, A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints, Neural network models and its application for solving linear and quadratic programming problems, On the Newton-type method with admissible trajectories for mixed complementarity problems, Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem, A filter method for solving nonlinear complementarity problems based on derivative-free line search, A Newton's method for perturbed second-order cone programs, Numerical aspects of non-smooth multibody dynamics, On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities, A smoothing Newton-type method for generalized nonlinear complementarity problem, A descent method for a reformulation of the second-order cone complementarity problem, Box-constrained minimization reformulations of complementarity problems in second-order cones, Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem, The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function, Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions, An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables, A multiple penalty function method for solving max-bisection problems, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, Boundedness and regularity properties of semismooth reformulations of variational inequalities, Constrained optimal control of Navier--Stokes flow by semismooth Newton methods, Jacobian smoothing Brown's method for NCP, Growth behavior of a class of merit functions for the nonlinear complementarity problem, Unconstrained minimization approaches to nonlinear complementarity problems, Equivalence of the generalized complementarity problem to differentiable unconstrained minimization, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP, A continuation algorithm for max-cut problem, Lipschitz continuity of the gradient of a one-parametric class of SOC merit functions, Domain Decomposition Methods for a Complementarity Problem*, An iterative method for solving KKT system of the semi-infinite programming, Flexible complementarity solvers for large-scale applications, A preconditioner for solving large-scale variational inequality problems by a semismooth inexact approach, Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation, Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method, A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM
Cites Work
- Unnamed Item
- Unnamed Item
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- On a Newton-like method for constrained nonlinear minimization via slack variables
- Note on the equivalence of Kuhn-Tucker complementarity conditions to an equation
- Newton's Method for B-Differentiable Equations
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- Continuous deformation of nonlinear programs
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
