Nonlinear leastpth optimization and nonlinear programming
From MaRDI portal
Publication:4152045
DOI10.1007/BF01593788zbMath0374.90061OpenAlexW2076161359MaRDI QIDQ4152045
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593788
Related Items (26)
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities ⋮ A smoothing inexact Newton method for variational inequalities with nonlinear constraints ⋮ A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ A new neural network for solving nonlinear projection equations ⋮ An Extended Projection Neural Network for Constrained Optimization ⋮ Perturbing the dual feasible region for solving convex quadratic programs ⋮ An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming ⋮ Convergence analysis of a differential equation approach for solving nonlinear programming problems ⋮ A two-stage feasible directions algorithm for nonlinear constrained optimization ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM ⋮ Unnamed Item ⋮ A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem ⋮ Nonlinear rescaling Lagrangians for nonconvex semidefinite programming ⋮ Further study on a dual algorithm ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ A dual algorithm for minimax problems ⋮ Acceleration of the leastpth algorithm for minimax optimization with engineering applications ⋮ Optimization of electrical circuits ⋮ Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints. ⋮ Improved dual algorithm for constrained optimization problems ⋮ A line search exact penalty method for nonlinear semidefinite programming ⋮ A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming ⋮ A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems ⋮ Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplier and gradient methods
- Nonlinear programming using minimax techniques
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
- A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
- An exact penalty function for nonlinear programming with inequalities
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- An Exact Potential Method for Constrained Maxima
- An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A new approach to variable metric algorithms
- Constrained Optimization Using a Nondifferentiable Penalty Function
- A computational comparison of some non-linear programs
This page was built for publication: Nonlinear leastpth optimization and nonlinear programming
