The following pages link to Nada I. Djuranović-Miličić (Q1090234):
Displaying 50 items.
- Smooth exact penalty functions: a general approach (Q279837) (← links)
- A sharp Lagrange multiplier theorem for nonlinear programs (Q300758) (← links)
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere (Q341317) (← links)
- Newton-Kantorovich convergence theorem of a modified Newton's method under the gamma-condition in a Banach space (Q364720) (← links)
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions (Q384215) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- A nonlinear augmented Lagrangian for constrained minimax problems (Q427029) (← links)
- Handling infeasibility in a large-scale nonlinear optimization algorithm (Q430999) (← links)
- Modified alternating direction methods for the modified multiple-sets split feasibility problems (Q467474) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- A reduced Hessian algorithm with line search filter method for nonlinear programming (Q544068) (← links)
- A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure (Q544129) (← links)
- Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
- Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
- High-order Newton-penalty algorithms (Q557745) (← links)
- Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
- (Q590416) (redirect page) (← links)
- Local convergence of a secant type method for solving least squares problems (Q618062) (← links)
- A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization (Q618130) (← links)
- A nonmonotone adaptive trust region method for unconstrained optimization based on conic model (Q618131) (← links)
- Nonmonotone trust region algorithm for unconstrained optimization problems (Q618133) (← links)
- Local convergence analysis of inexact Newton-like methods under majorant condition (Q626659) (← links)
- Convergence of Newton's method for sections on Riemannian manifolds (Q630023) (← links)
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior (Q639941) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
- A constraint shifting homotopy method for convex multi-objective programming (Q651890) (← links)
- Global optimization of nonlinear sum of ratios problem (Q702537) (← links)
- Global optimizations and tabu search based on memory (Q702667) (← links)
- A new double trust regions SQP method without a penalty function or a filter (Q712469) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- A cutting-plane method without inclusions of approximating sets for conditional minimization (Q748232) (← links)
- A line search filter algorithm with inexact step computations for equality constrained optimization (Q765270) (← links)
- Make \(\ell_1\) regularization effective in training sparse CNN (Q782914) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations (Q861492) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- A deterministic global optimization algorithm (Q870181) (← links)
- An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization (Q879466) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- A penalty function method for solving weak price control problem (Q884619) (← links)
- A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization) (Q944053) (← links)
- Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
- Smoothing Newton method for minimizing the sum of \(p\) -norms (Q946175) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems (Q963957) (← links)
- A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
- A neural network for solving a convex quadratic bilevel programming problem (Q964970) (← links)
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (Q983712) (← links)
