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