Pages that link to "Item:Q4229467"

The following pages link to Primal-Dual Interior Methods for Nonconvex Nonlinear Programming (Q4229467):

Displaying 50 items.

• A primal-dual augmented Lagrangian (Q434173) (← links)
• Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
• Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
• A stabilized SQP method: superlinear convergence (Q526843) (← links)
• Primal-dual interior-point method for thermodynamic gas-particle partitioning (Q538298) (← links)
• On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming (Q700757) (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
• Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
• Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
• Reduced-basis techniques for rapid reliable optimization of systems described by affinely parametrized coercive elliptic partial differential equations (Q1027156) (← links)
• Assessing a multiple QTL search using the variance component model (Q1631155) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
• An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
• The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
• Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
• Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
• Primal-dual Newton-type interior-point method for topology optimization (Q1862194) (← links)
• An interior method for nonconvex semidefinite programs (Q1863841) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• A primal-dual modified log-barrier method for inequality constrained nonlinear optimization (Q2228414) (← links)
• Component-wise reduced order model lattice-type structure design (Q2236960) (← links)
• A primal-dual interior point method for large-scale free material optimization (Q2350868) (← links)
• Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
• An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
• An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A primal-dual interior-point algorithm for nonlinear least squares constrained problems (Q2568604) (← links)
• Globally convergent interior-point algorithm for nonlinear programming (Q2569192) (← links)
• Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions (Q2569198) (← links)
• Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (Q2643614) (← links)
• Shifted L-BFGS systems (Q2926066) (← links)
• General primal-dual penalty/barrier path-following Newton methods for nonlinear programming (Q3534650) (← links)
• (Q3640729) (← links)
• A general class of penalty/barrier path-following Newton methods for nonlinear programming (Q4675963) (← links)
• The interior-point revolution in optimization: History, recent developments, and lasting consequences (Q4829921) (← links)
• A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
• A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
• Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems (Q5093264) (← links)
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
• A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization (Q5268888) (← links)
• A Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control (Q5363377) (← links)
• A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces (Q6133339) (← links)