scientific article
From MaRDI portal
Publication:3690580
zbMath0572.90067MaRDI QIDQ3690580
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
unconstrained optimizationrates of convergencesteepest descentconjugate gradientpenalty methodsfinite dimensional optimizationLagrange multiplier methodsquasi Newtonnondifferentiable constraintsdiscretized optimal control problemssecond order multiplier update strategies
Numerical mathematical programming methods (65K05) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx) Methods of successive quadratic programming type (90C55) Mathematical programming (90C99) Optimality conditions for free problems in two or more independent variables (49K10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Related Items (only showing first 100 items - show all)
On the role of continuously differentiable exact penalty functions in constrained global optimization ⋮ A globally convergent primal-dual interior point algorithm for convex programming ⋮ Nonmonotone stabilization methods for nonlinear equations ⋮ Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems ⋮ Solving cone-constrained convex programs by differential inclusions ⋮ Convergence property of the Iri-Imai algorithm for some smooth convex programming problems ⋮ An unconstrained optimization technique for large-scale linearly constrained convex minimization problems ⋮ On the problem of stable image restoration ⋮ Asymptotic analysis of the exponential penalty trajectory in linear programming ⋮ On the exactness of a class of nondifferentiable penalty functions ⋮ Dual techniques for constrained optimization ⋮ New results on a class of exact augmented Lagrangians ⋮ A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems ⋮ Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure ⋮ Random tunneling by means of acceptance-rejection sampling for global optimization ⋮ Nonlinear rescaling and proximal-like methods in convex optimization ⋮ Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization ⋮ Abstract estimates of the rate of convergence for optimal control problems ⋮ Family of projected descent methods for optimization problems with simple bounds ⋮ Interior-point methods: An old and new approach to nonlinear programming ⋮ On the entropic regularization method for solving min-max problems with applications ⋮ Perturbing the dual feasible region for solving convex quadratic programs ⋮ Convexity of the implicit Lagrangian ⋮ Convergence rate of the augmented Lagrangian SQP method ⋮ Image space approach to penalty methods ⋮ An ODE traffic network model ⋮ Inexact accelerated augmented Lagrangian methods ⋮ Combining stabilized SQP with the augmented Lagrangian algorithm ⋮ A robust and informative method for solving large-scale power flow problems ⋮ Weighted optimization for multiobjective full-information control problems ⋮ Numerical concepts for rate-independent single crystal plasticity ⋮ An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface ⋮ Enlarging the region of convergence of Newton's method for constrained optimization ⋮ Augmented Lagrangian theory, duality and decomposition methods for variational inequality problems ⋮ Modern homotopy methods in optimization ⋮ Projected quasi-Newton algorithm with trust region for constrained optimization ⋮ Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function ⋮ The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces ⋮ Models for multimode multicommodity location problems with interdepot balancing requirements ⋮ Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints ⋮ The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming ⋮ Duality for multiobjective optimization via nonlinear Lagrangian functions ⋮ A trust region algorithm for equality constrained optimization ⋮ A successive quadratic programming method for a class of constrained nonsmooth optimization problems ⋮ Decomposition algorithm for convex differentiable minimization ⋮ Approximate nonlinear programming algorithms for solving stochastic programs with recourse ⋮ Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem ⋮ Convergence rates of a multilevel method for the regularization of nonlinear ill-posed problems ⋮ An analytical approach to global optimization ⋮ Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization ⋮ An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems ⋮ Complexity analysis of a linear complementarity algorithm based on a Lyapunov function ⋮ A derivative-free algorithm for systems of nonlinear inequalities ⋮ Modified barrier functions (theory and methods) ⋮ Hamiltonian dynamics of a rigid body in a central gravitational field ⋮ Determining subspaces on which a matrix is nonnegative definite ⋮ An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems ⋮ Complete decomposition algorithm for nonconvex separable optimization problems and applications ⋮ On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators ⋮ Exact augmented Lagrangian function for nonlinear programming problems with inequality constraints ⋮ Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization ⋮ Some convex programs without a duality gap ⋮ A coordinate gradient descent method for nonsmooth separable minimization ⋮ Application of the alternating direction method of multipliers to separable convex programming problems ⋮ A review of open queueing network models of manufacturing systems ⋮ Separation approach for augmented lagrangians in Constrained nonconvex optimization ⋮ Approximate Lagrange multiplier algorithm for stochastic programs with complete recourse: Nonlinear deterministic constraints ⋮ Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization ⋮ Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ An optimal control formulation of an image registration problem ⋮ Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints ⋮ Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences ⋮ A note on the regularity of reduced models obtained by nonlocal quasi-continuum-like approaches ⋮ Perturbation lemma for the Newton method with application to the SQP Newton method ⋮ Progressive regularization of variational inequalities and decomposition algorithms ⋮ Runge-Kutta based procedure for the optimal control of differential-algebraic equations ⋮ Parameter constraints in generalized linear latent variable models ⋮ Representation of normal cone inclusion problems in dynamics via nonlinear equations ⋮ High-dimensional data visualisation: the textile plot ⋮ Duality and penalization in optimization via an augmented Lagrangian function with applications ⋮ Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems ⋮ Identification of region of attraction for global optimization problem using interval symmetric operator ⋮ Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ A sequential quadratic programming-based algorithm for the optimization of gas networks ⋮ Local analysis of Newton-type methods for variational inequalities and nonlinear programming ⋮ Sequential quadratic programming methods for optimal control problems with state constraints ⋮ Descent methods for convex essentially smooth minimization ⋮ A globally convergent algorithm for nonlinearly constrained optimization problems ⋮ Proximal minimization algorithm with \(D\)-functions ⋮ Global linear convergence of a path-following algorithm for some monotone variational inequality problems ⋮ Augmented Lagrangian algorithms for linear programming ⋮ Equality and inequality constrained optimization algorithms with convergent stepsizes ⋮ Measuring rates of convergence of numerical algorithms ⋮ Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints ⋮ Analysis and implementation of a dual algorithm for constrained optimization ⋮ Parallel alternating direction multiplier decomposition of convex programs ⋮ Nonlinear complementarity as unconstrained and constrained minimization
This page was built for publication:
