Pages that link to "Item:Q1186277"
From MaRDI portal
The following pages link to Modified barrier functions (theory and methods) (Q1186277):
Displaying 50 items.
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- A class of nonlinear Lagrangians for nonconvex second order cone programming (Q540625) (← links)
- Uniform approximation of min/max functions by smooth splines (Q651900) (← links)
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization (Q695341) (← links)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
- Lagrangian regularization approach to constrained optimization problems (Q703420) (← links)
- Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property (Q721143) (← links)
- Barrier function method and correction algorithms for improper convex programming problems (Q735654) (← links)
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility (Q746818) (← links)
- Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach (Q779763) (← links)
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
- Unified theory of augmented Lagrangian methods for constrained global optimization (Q839330) (← links)
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
- A modified nearly exact method for solving low-rank trust region subproblem (Q868456) (← links)
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465) (← links)
- Penalty and barrier methods for convex semidefinite programming (Q883081) (← links)
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization (Q1004224) (← links)
- Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones (Q1023315) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Some characterizations for SOC-monotone and SOC-convex functions (Q1037358) (← links)
- Modified barrier functions (theory and methods) (Q1186277) (← links)
- A new linesearch method for quadratically constrained convex programming (Q1342277) (← links)
- Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Free material optimization via mathematical programming (Q1365069) (← links)
- Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints (Q1429323) (← links)
- Fuzzy adaptive switching control for an uncertain robot manipulators with time-varying output constraint (Q1654315) (← links)
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem (Q1734367) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) (← links)
- The Newton modified barrier method for QP problems (Q1915923) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← links)
- Saddle point and exact penalty representation for generalized proximal Lagrangians (Q1928261) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Dual fast projected gradient method for quadratic programming (Q1947612) (← links)
- Existence of local saddle points for a new augmented Lagrangian function (Q1958815) (← links)
- ROTEC: robust to early termination command governor for systems with limited computing capacity (Q2124478) (← links)
- Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables (Q2178348) (← links)
- A primal-dual modified log-barrier method for inequality constrained nonlinear optimization (Q2228414) (← links)
- On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints (Q2269590) (← links)
- Determinantal sampling designs (Q2317241) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems (Q2350402) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function (Q2372014) (← links)
- A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
