Pages that link to "Item:Q1294828"
From MaRDI portal
The following pages link to An interior-point algorithm for nonconvex nonlinear programming (Q1294828):
Displaying 50 items.
- Theory and applications of optimal control problems with multiple time-delays (Q380575) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Free material optimization for stress constraints (Q445504) (← links)
- Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
- On formation of security portfolio with uniform distribution by logarithmic criterion and priority risk component (Q463348) (← links)
- Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes (Q474386) (← links)
- Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
- Numerical experiments with an inexact Jacobian trust-region algorithm (Q535288) (← links)
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- DrAmpl: A meta solver for optimization problem analysis (Q601972) (← links)
- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts (Q646346) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- Optimization problems with equilibrium constraints and their numerical solution. (Q703216) (← links)
- An efficient method for nonlinearly constrained networks (Q706946) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- Computation of projection regression depth and its induced median (Q830082) (← links)
- Case studies in optimization: catenary problem (Q833405) (← links)
- Effective reformulations of the truss topology design problem (Q833422) (← links)
- An inexact Newton method for nonconvex equality constrained optimization (Q847853) (← links)
- On central-path proximity measures in interior-point methods (Q850820) (← links)
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Interior-point algorithms, penalty methods and equilibrium problems (Q853552) (← links)
- Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
- A note on the use of vector barrier parameters for interior-point methods (Q877030) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716) (← links)
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm (Q925253) (← links)
- Global convergence of slanting filter methods for nonlinear programming (Q932546) (← links)
- A local convergence property of primal-dual methods for nonlinear programming (Q948957) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- An interior-point algorithm for nonlinear minimax problems (Q963659) (← links)
- Mesh shape-quality optimization using the inverse mean-ratio metric (Q985312) (← links)
- Generalized convexity in multiple view geometry (Q993590) (← links)
- A Newton-like method for nonlinear system of equations (Q1039287) (← links)
- Solving elliptic control problems with interior point and SQP methods: Control and state constraints (Q1578854) (← links)
- Sequential quadratic programming for large-scale nonlinear optimization (Q1593815) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
- An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- A starting point strategy for nonlinear interior methods. (Q1767154) (← links)
- Detecting and approximating fault lines from randomly scattered data (Q1776173) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
