Modified barrier functions (theory and methods)
From MaRDI portal
Publication:1186277
DOI10.1007/BF01586050zbMath0756.90085MaRDI QIDQ1186277
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
multipliers methodssuperlinear rate of convergencemodified barrier functionsnonconvex constrained optimizationnonlinear rescaling principle
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, ROTEC: robust to early termination command governor for systems with limited computing capacity, Combining phase I and phase II in a potential reduction algorithm for linear programming, Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming, A nonlinear Lagrangian based on Fischer-Burmeister NCP function, A new linesearch method for quadratically constrained convex programming, Scaling, shifting and weighting in interior-point methods, Unified theory of augmented Lagrangian methods for constrained global optimization, Decomposition Methods Based on Augmented Lagrangians: A Survey, Primal-dual nonlinear rescaling method for convex optimization, Nonlinear rescaling and proximal-like methods in convex optimization, Fuzzy adaptive switching control for an uncertain robot manipulators with time-varying output constraint, A penalty-interior-point algorithm for nonlinear constrained optimization, How to deal with the unbounded in optimization: Theory and algorithms, Free material optimization via mathematical programming, Nonlinear rescaling as interior quadratic prox method in convex optimization, A modified nearly exact method for solving low-rank trust region subproblem, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, Computational experience with penalty-barrier methods for nonlinear programming, The Newton modified barrier method for QP problems, Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables, Condition numbers for polyhedra with real number data, Penalty and barrier methods for convex semidefinite programming, Saddle point and exact penalty representation for generalized proximal Lagrangians, The Legendre Transformation in Modern Optimization, Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems, Dual fast projected gradient method for quadratic programming, Some results on augmented Lagrangians in constrained global optimization via image space analysis, A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM, An entire space polynomial-time algorithm for linear programming, Existence of local saddle points for a new augmented Lagrangian function, Uniform approximation of min/max functions by smooth splines, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints, Modified Barrier Penalization Method for Pricing American Options, A primal-dual modified log-barrier method for inequality constrained nonlinear optimization, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, Modified barrier functions (theory and methods), A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada, Support vector machine via nonlinear rescaling method, The Sequential Quadratic Programming Method, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, Solving nonconvex SDP problems of structural optimization with stability control, 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization, Nonlinear rescaling Lagrangians for nonconvex semidefinite programming, Saddle points of general augmented Lagrangians for constrained nonconvex optimization, Mechanical design problems with unilateral contact, A class of nonlinear Lagrangians for nonconvex second order cone programming, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization., Lagrangian regularization approach to constrained optimization problems, Abstract convexity for nonconvex optimization duality, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, A new family of penalties for augmented Lagrangian methods, Reformulation descent applied to circle packing problems, On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints, Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method, Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property, Free material optimization: recent progress†, Improved dual algorithm for constrained optimization problems, A nonlinear Lagrangian for constrained optimization problems, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, PENNON: Software for Linear and Nonlinear Matrix Inequalities, Barrier function method and correction algorithms for improper convex programming problems, The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, Primal–dual exterior point method for convex optimization, Augmented Lagrangian methods for nonlinear programming with possible infeasibility, Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, Determinantal sampling designs, Some characterizations for SOC-monotone and SOC-convex functions, Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization, Decomposition for structured convex programs with smooth multiplier methods, An exterior point polynomial-time algorithm for convex quadratic programming, Unnamed Item, Lagrangian transformation and interior ellipsoid methods in convex optimization, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems, Penalty/Barrier multiplier algorthm for semidefinit programming∗, Active-set prediction for interior point methods using controlled perturbations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Unified complexity analysis for Newton LP methods
- Modified barrier functions (theory and methods)
- Multiplier and gradient methods
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Smooth Optimization Methods for Minimax Problems
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- The method of penalty estimates for conditional extremum problems
- Convex Analysis
